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 solve(x, y, z):
    if x == y:
        z = int(math.sqrt(z))
        x = x // z
        return 8*z + 4*x
    elif x == z:
        y = int(math.sqrt(y))
        x = x // y
        return 8*y + 4*x
    elif y == z:
        x = int(math.sqrt(x))
        y = y // x
        return 8*x + 4*y

def main():
    l = list(map(int, input().strip().split()))
    print(solve(l[0], l[1], l[2]))

if __name__ == "__main__":
    main()