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.
a,b,c=map(int,input().split())
al=[]
bl=[]
cl=[]
for i in range(1,min(a,b,c)+1):
    if(a%i==0):
        al.append(i)
    if(b%i==0):
        bl.append(i)
    if(c%i==0):
        cl.append(i)
mc=smc=1
for i in range(min(len(al),len(bl),len(cl))):
    if(al[i]==bl[i]==cl[i]):
        mc=al[i]
    elif(al[i]==bl[i]):
        smc=al[i]
    elif(al[i]==cl[i]):
        smc=al[i]
    elif(bl[i]==cl[i]):
        smc=bl[i]
print((4*mc)+(4*mc)+(4*smc))