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 findxy(x):
    for i in range(1, x+1):
        for j in range(1, x):
            if i*j == x:
                return [i, j]

def find_fac(x, y):
    for i in range(1, y+1):
        if x*i == y:
            return i

x, y, z = map(int, input().split())        

if x == 1 and y == 1 and z == 1:
    print(12)
elif x == 1:
    a = 1
    b = y
    c = find_fac(b, z)
    total = a+b+c
    print(total*4)
else:        
    l = []
    l = findxy(x)
    a = l[0]
    b = l[1]

    c = find_fac(b, z)
    total = a+b+c
    print(total*4)
