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.
l=list(map(int, input().split()))
for i in range(3):
	p=l[i]**(1/2)
	if(p==int(p)):
		j=i
		break;
if(j==0):
	s=(l[j+1]/p)*4
else:
	s=(l[j-1]/p)*4
s+=(8*p)
print(s)