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.
from itertools import permutations

areas = [int(c) for c in input().split()]

for x, y, z in permutations(areas):
    if (x * y) % z != 0:
        continue

    a_sqr = x * y // z

    if int(a_sqr ** 0.5) ** 2 != a_sqr:
        continue

    a = int(a_sqr ** 0.5)

    if y % a != 0:
        continue

    b = y // a

    if z % b != 0:
        continue

    c = z // b

    ans = 4 * (a + b + c)
    print(ans)
    exit()

