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())
fxy = []
fz = []
mini = min(x,y)
for i in range(1,mini+1):
	if(x%i==0 and y%i==0):
		fxy.append(i)

for i in range(1,z+1):
	if(z%i==0):
		fz.append(i)

for i in fxy:
	if(x/i in fz and y/i in fz):
		print(int(4*(x/i) + 4*(y/i) + 4*(i)))
		break
