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.
def MDC(a, b):
  while(b != 0):
    resto = a % b
    a = b
    b = resto
  
  return a

a, b, c = map(int, input().split())

if MDC(a, b) == a and a != 1:
  x = MDC(a,b)

else:
  x = MDC(a,b) * 2

if MDC(a,c) == a and a != 1:
  z = MDC(a,c)

else:
  z = MDC(a,c) * 2

if MDC(b,c) == b and a != 1:
  y = MDC(b,c)

else:
  y = MDC(b, c) * 2

print(2*(x + y + z))
  	 		 		   				 	  	 	 	