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 sys
sides = list(map(int, input().split()))
a1 = sides[0]
a2 = sides[1]
a3 = sides[2]
# 4x + 4y + 4z = ?
# a1 = y*sin(0)*x
# a2 = z*sin(0)*x
# a3 = y*sin(0)*z
# a1*z = a2*y
# a1*z = a3*x
# a2*y = a3*x
# a1*z = a2*y
# a2*y = a3*x
for x in range(1,1001):
    for y in range(1,1001):
        for z in range(1,1001):
            if a1*z == a2*y and a2*y == a3*x:
                print(4*x + 4*y + 4*z)
                sys.exit(0)