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.
#!/usr/bin/env python3

if __name__ == "__main__":
	a1, a2, a3 = map(int, input().split())
	a_sum = a1 + a2 + a3
	a_prod = a1*a2*a3
	e_sum = ((a_prod)/(a1**2) + (a_prod)/(a2**2) + (a_prod)/(a3**2) + 2*a_sum)**0.5
	print(int(4*e_sum))
