You've got a rectangular parallelepiped with integer edge lengths. You know the areas of its three faces that have a common vertex. Your task is to find the sum of lengths of all 12 edges of this parallelepiped.
The first and the single line contains three space-separated integers — the areas of the parallelepiped's faces. The area's values are positive ( &gt; 0) and do not exceed 10<sup class="upper-index">4</sup>. It is guaranteed that there exists at least one parallelepiped that satisfies the problem statement.
s1,s2,s3 = map(int, input().split())
#side of s1 and side of s2 == s3
#height of s1 and s2 are the same
for i in range(1,min(s1,s2) + 1):
    otherS1 = s1/i
    otherS2 = s2/i
    if(otherS1 * otherS2 == s3):
        #matchFound
        print(int(4 * (i + otherS1 + otherS2)))