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.
def gcd(a,b):
    if b==0:
        return a
    else:
        return gcd(b,a%b)

list1=list(map(int,input().split()))
lcm=list1[0]
for i in range(1,len(list1)):
    lcm=lcm*list1[i]//gcd(lcm,list1[i])
sum1=0
for key,value in enumerate(list1):
    sum1+=(lcm//value)

print(sum1*4)

