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 = map(int, input().split())
d = False
for i in range(1,101):
    for j in range(1, 101):
        for k in range(1, 101):
            if i*j==a and j*k==b and i*k==c:
                print(4*(i+j+k))
                d = True
                break
        if d : 
            break
    if d : 
        break
