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.
import math
a,b,c = map(int,input().split())
l = [a,b,c]
list1 = sorted(l)
x = math.gcd(list1[0],list1[1])
y = math.gcd(list1[0],list1[2])
z = min(x,y)
s =set(list1)
s=list(s)
if len(s)==1:
    a = z
    b = a//z
    c=a//z
elif len(s)==2:
    a = z
    b = s[0]//z
    c = s[1]//z
else:
    a = list1[0]
    b = list1[1]//z
    c  =list1[2]//z
print(a*4+b*4+c*4)