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.
a, b, c = list(map(int, input().split()))
s1 = a*b
s3 = a*c
s2 = b*c
a = (s1*s2/(s3*c))**(1/2)
b = (s1*s3/(s2*b))**(1/2)
c = (s2*s3/(s1*a))**(1/2)
print(int(4*(a+b+c)))
