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.
# with open("input.txt",'r') as f:
# 	t = int(f.readline().rstrip())
# 	# n = int(f.readline().rstrip())
	# n ,a,b   = int(f.readline().rstrip().split())
# 	# arr = list(map(int,f.readline().rstrip().split()))





import math 
def main(arr):
	a1 = math.sqrt((arr[0]*arr[1])//arr[2])
	a2 = math.sqrt((arr[0]*arr[2])//arr[1])
	a3 = math.sqrt((arr[1]*arr[2])//arr[0])
	ans = (a1*4) + (a2*4)+(a3*4)
	print(int(ans))

arr = list(map(int,input().split()))
# arr.sort()
# arr = [50,10,20]
main(arr)