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.
l=list(map(int,input().split()))
a=0
b=0
c=0
for i in range(1,max(l[0],l[1])+1):
  if(l[0]%i==l[1]%i==0  and (l[1]//i * l[0]//i)==l[2]):
    a=i
    b=l[1]//i
    c=l[0]//i
    break
print((a+b+c)*4)