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