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.
x,y,z=map(int,input().split())
a2=(x*z)/y
b2=(x*y)/z
c2=(y*z)/x
a_b_c_2=a2+b2+c2+2*(x+y+z)
a_b_c=a_b_c_2**(0.5)
print(int(4*a_b_c))