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 = sorted((int(x) for x in input().split()))
k = max(A,B,C)

for a in range(1,k+1):
    if A%a == 0 and C%a == 0:
        if A*C == B * a * a:
            print( 4*sum((a,A//a,C//a)) ) 
            break
    