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.
# Parallelepiped
a1,a2,a3 = map(int,input().split(" "))
l = ((a1/a2)*a3)**0.5
h = ((a2/a3)*a1)**0.5
b = ((a2/a1)*a3)**0.5
x = (l+h+b)*4
if x == int(x):
  print(int(x))
else:
  print(x)