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 solve(ab, bc, ac):
	for a in range(1, limit):
		for b in range(1, limit):
			if a*b == ab and bc//b == ac//a:
				return 4*(a+b+(bc//b))
	return -1

limit = int(1e4)+1
ab, bc, ac = map(int, input().strip().split())
print(solve(ab, bc, ac))
