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 = list(map(int,input().split()))
tf = False
for x in range(1,a+b):
     if tf:
          break
     if (a+b)%x == 0:
          y = 1
          while y < (a+c)/x:
               if (a+b)%y == 0:
                    if (a+c)/x-y == (a+b)/y-x and (b+c)%(x+y) == 0 and (a+c)/x-y == (b+c)/(x+y):
                         print(int(4*(x+(a+c)/x)))
                         tf = True
                         break
               y += 1