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.
l=[int(i) for i in input().split()]
o=max(l)
l.sort()
f=0
for i in range(1,l[0]+1):
    for j in range(1,l[1]+1):
        for k in range(1,l[2]+1):
            if (i*j==l[0] or j*k==l[0] or k*l==l[0]) and (i*j==l[1] or j*k==l[1] or k*l==l[1]) and (i*j==l[2] or j*k==l[2] or k*l==l[2]):
                print(4*(i+j+k))
                f=1
                break
        if f==1:
            break
    if f==1:
        break
