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 solve() :
    xy=a
    yz=b
    zx=c

    x=((zx)*(xy)/(yz))**0.5
    y=((xy)*(yz)/(zx))**0.5
    z=((zx)*(yz)/(xy))**0.5

    return int(4*(x+y+z))








        

    

a,b,c=[int(x) for x in input().split()]

print(solve())



'''
n,m= [int(x) for x in input().split()]
arr=[]
for i in range(n):
    arr.append([int(x) for x in input().split()])
'''
'''
n=int(input())
arr=[int(x) for x in input().split()]
'''