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.
x,y,z=map(int,input().split())

for a in range(max(x,y,z)+1):
	for b in range(max(x,y,z)+1):
		for c in range(max(x,y,z)+1):
			if(a*b==x and b*c==y and c*a==z):
				print(4*(a+b+c))
				break