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*
a1, a2, a3 = [int(x) for x in input().split()]

s1 = int(sqrt((a1/a3)*a2))
s2 = int(a2/s1)
s3 = int(a1/s1)

print((min(s1, min(s2, s3))*2 + max(s2, max(s3, s1)))*4)
# print(s1, s2, s3)
