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.
X = list(map(int,input().split()))

def gcd(a,b):
    if(b == 0):
        return abs(a)
    else:
        return gcd(b,a%b)
    
x = gcd(X[0],X[1])
y = X[0]/x
z = X[2]/y

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