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())
e1,e2,e3=0,0,0
if a==1 and b==1 and c==1 :
    print(12)
else :
    for x in range(2,a+1) :
        if a%x==0 and b%x==0 :            
            e1=x
            e2=a//x
            e3=b//x
            break
    print((e1+e2+e3)*4)