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 ceil

def sqrt(x):
  return pow(x, 0.5)

m, n, p = map(int, input().split())
a = int(sqrt((n * p) // m))
b = int(sqrt((m * p) // n))
c = int(sqrt((m * n) // p))
print(4 * (a + b + c))

'''
* So I drown it out 
* Like I always do
* Dancing through our house
* With the ghost of you
'''
