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.
a,b,c = map(int,input().split())
del_a = []
del_b = []
del_c = []

n = 1
while n**2 <= a:
  if a%n == 0:
    del_a.append(n)
    if a//n not in del_a:
      del_a.append(a//n)
  n+=1
n = 1

while n**2 <= b:
  if b%n == 0:
    del_b.append(n)
    if b//n not in del_b:
      del_b.append(b//n)
  n += 1
n = 1
while n**2 <= c:
  if c%n == 0:
    del_c.append(n)
    if c//n not in del_c:
      del_c.append(c//n)
  n += 1
ot = []
for i in del_a:
  if i in del_b and a//i in del_c and b//i in del_c and c//(a//i) in del_b and b//(c//(a//i)) in del_a and i * c//(a//i) == b:
    ot.append(i*4 + a//i*4 + c//(a//i)*4)
print(min(ot))