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 find_fac(x, y):
    for i in range(1, y+1):
        if i*x == y:
            return i
    
    return 0        

x, y, z = map(int, input().split())        
flag = False
for i in range(1, x+1):
    for j in range(1, x+1):
        if i*j == x and find_fac(j, y) != 0:
            a = i
            b = j
            c = find_fac(j, y)
            flag = True
            break
    if flag:
        break

print((a+b+c)*4)        
