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 gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


x, y, z = map(int, input().split())

if x == y == z:
    print(int(x ** 0.5) * 12)
else:
    if x != y:
        a = gcd(x, y)
        b = x // a
        c = y // a
    else:
        a = gcd(x, z)
        b = x // a
        c = z // a
    print(4 * (a + b + c))