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
A, B, C = map(int, input().split())
#ab = A[0], bc = A[1], ac = A[2]

ABC = A*B*C
abc = int(math.sqrt(ABC) + 2)

while abc**2 > ABC:
	abc -= 1

a = abc//B
b = abc//C
c = abc//A

print(4*(a+b+c))

