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.
a1, a2, a3 = map(int, input().split())

for i in range(1, a1+1):
	
	j = a1/i

	if(i * j != a1):
		continue

	k = a2 / i

	if(i * k != a2):
		continue

	if(j * k != a3):
		continue

	print(int(4*(i+j+k)))
	break