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 process():
    x, y, z = list(map(int, input().split()))
    
    i = 1
    while i * i <= x:
        if x % i == 0:
            a = i
            b = x // i
            if y % a == 0 and z % b == 0:
                print(4 * sum([a, b, y // a]))
                return
            elif y % b == 0 and z % a == 0:
                print(4 * sum([a, b, y // b]))
                return
        
        i += 1
    
process()