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 findDivisors(x):
    divisors = []
    i = 1
    while i <= x:
        if x % i == 0: divisors.append(i)
        i += 1
    return divisors

def findMCD(x, y):
    if x[len(x)-1] > y[len(y)-1]:
        x.reverse()
        for number in x:
            if number in y: return number
    else:
        y.reverse()
        for number in y:
            if number in x: return number

def sumPerimeter(a, b, c):
    return ((4*a) + (4*b) + (4*c))

(f1, f2, f3) = tuple(map(int,input().split()))
if f1 != 1 and f2 != 1 and f3 != 1:
    #f1 = a * c
    #f2 = a * b
    #f3 = b * c

    divisorsF1 = findDivisors(f1)
    divisorsF2 = findDivisors(f2)
    #divisorsF3 = findDivisors(f3)

    a = findMCD(divisorsF1, divisorsF2)
    b = int(f2 / a)
    c = int(f3 / b)
    print(sumPerimeter(a,b,c))
else:
    print(3*4)

  	 	 	  				 	  	 	 	 	   	