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.
"""
Logic:
1. Rectangular parallelpiped, so the areas of faces are ab , bc , ca
2. given ab , bc , ca : we solve for a,b,c
3. 4 * (a+b+c) will give the answer
"""
import math

ab, bc, ca = list(map(int, input().rstrip().split()))
a = int(math.sqrt(ab * ca / bc))
b = int(math.sqrt(ab * bc / ca))
c = int(math.sqrt(ca * bc / ab))
print(4 * (a + b + c))
