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.
def Sol(arr):
	
	n=1
	while True:
		if arr[0]%n == 0 and arr[1]%n == 0:
			if arr[0]*arr[1]/(n*n) == arr[2]:
				break
		n += 1
	
	print(4*int(arr[0]/n + arr[1]/n + n))
	return

arr = list(map(int,input().split()))
Sol(arr)