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=[int(x) for x in input().split()]
length=0.0
breadth=0.0
height=0.0

length=((s1*s3)/s2)**.5
breadth=((s1*s2)/s3)**.5
height=((s2*s3)/s1)**.5
print(int(4*(length+breadth+height)))
