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.
x1 = int(input())
x2 = int(input())
x3 = int(input())
end = 0
c = 0

for i in range(1,10000):
	tmp1 = i+1
	if x1 == 1 and x2 == 1 and x3 == 1:
		end = 1
		a = x1
		b = x2
		c = x3
		break

	if end == 1:
		break
		
	for x in range(1,10000):
		tmp2 = x
		if tmp1 * tmp2 == x1 and x1 > 1  or tmp1 * tmp2 == x2 and x2 > 1  or tmp1 * tmp2 == x3 and x3 > 1 :
			a = tmp1
			b = tmp2
			end = 1
			break


if c == 0 :			
	for i in range(1,10000):
		tmp3 = i
		if tmp3 * a == x1 or tmp3 * a == x2 or tmp3 * a == x3:
			c = tmp3

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