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 math import sqrt
l = input().split(' ')
A1, A2, A3 = int(l[0]), int(l[1]), int(l[2])
"""
Up: A1 = a * b
front: A2 = b * c
side: A3 = a * c

A1/A2 = a/c
A2/A3 = b/a
A1/A3 = b/c

A1A2/A3 = b^2
b = sqrt(A1A2/A3)
A1A3/A2 = a^2
a = sqrt(A1A3/A2)
A2A3/A1 = c^2
c = sqrt(A2A3/A1) 
"""
print(4*(int(sqrt(A1 * A2/A3))+int(sqrt(A1 * A3/A2))+int(sqrt(A2 * A3/A1))))
