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.
import math


def main_function():
    x, y, z = [int(i) for i in input().split(" ")]
    one = [x, y, z]
    two = [z, x, y]
    three = [y, z, x]
    for i in [one, two, three]:
        x, y, z = i
        if (x * y) % z == 0 and math.sqrt((x * y) // z) == math.ceil(math.sqrt((x * y) // z)):
            a = int(math.sqrt((x * y) // z))
            b = x // a
            c = y // a
    print(4 * a + 4 * b + 4 * c)


main_function()
