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 math
a1 , a2 , a3 = map(int,input().split())
f = a1/a2
c = math.ceil(math.sqrt(a3/math.ceil(f)))
a = math.ceil(c*math.ceil(f))
s = math.ceil(a3/a2)
b = math.ceil(s/a)
# print(s,f)
# print(a,b,c)
sum1=4*(a+b+c)
print(int(sum1))