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.
list1=list(map(int,input().split()))
def gcd(a,b):
    if b==0:
        return a
    else:
        return gcd(b,a%b)
gcd_num=list1[0]
for i in range(1,len(list1)):
    gcd_num=gcd(gcd_num,list1[i])
sum1=0
min_area=min(list1)
max_area=max(list1)
sum1=gcd_num*4
sum1+=(min_area/gcd_num)*4
sum1+=(max_area/gcd_num)*4
print(int(sum1))