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.
areas = [int(i) for i in input().split()]
vals = []

for i in range(1, min(areas) + 1):
	if areas[0]%i == 0 and areas[1]%i == 0 and (areas[0]/i)*(areas[1]/i) == areas[2]:
		vals = [i, areas[0]/i, areas[1]/i]
		break
	if areas[1]%i == 0 and areas[2]%i == 0 and (areas[1]/i)*(areas[2]/i) == areas[0]:
		vals = [i, areas[1]/i, areas[2]/i]
		break
	if areas[0]%i == 0 and areas[2]%i == 0 and (areas[0]/i)*(areas[2]/i) == areas[1]:
		vals = [i, areas[0]/i, areas[2]/i]

print(4*sum(vals))
