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.
a, b, c = tuple([int(x) for x in input().split()])
for i in range(1, 100):
	if(a % i == 0):
		c1 = i
		c2 = a // i
		if(b % c1 == 0 and c % c2 == 0 and b // c1 == c // c2):
			print((c1 + c2 + b // c1) * 4)
			exit()
		if(b % c2 == 0 and c % c1 == 0 and b // c2 == c // c1):
			print((c1 + c2 + b // c2) * 4)
			exit()
				
"""
2 3 4
6 12 8
2 3
2 6 or 3 4
4

c1 = 2
c2 = 3



1 2
2 1
1 1
"""