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