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.
x, y, z = map(int, input().split())

def gcd(a, b):
    while b != 0:
        a, b = b, a % b
    return a

def lcm(a, b, c):
    gcd_ab = gcd(a, b)
    lcm_ab = a * b // gcd_ab
    lcm_abc = lcm_ab * c // gcd(lcm_ab, c)
    return lcm_abc
  
lcm_res = lcm(x, y, z)
l = []
i = 2
if lcm_res == 1:
  l = [1, 1, 1]
else:
  while lcm_res > 1:
    if lcm_res % i == 0:
      l.append(i)
      lcm_res //= i
    else:
      i += 1

ans = 0
for i in l:
  ans += i * 4

print(ans)
