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())

if a == b == c:
    print(int(12*(a**(1/2))))
else:
    e1 = ((a*b) // c)**(1/2)
    e2 = ((b*c) // a)**(1/2)
    e3 = ((a*c) // b)**(1/2)

    print(int(4 * (e1 + e2 + e3)))