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.
root = {}

for i in range(10**6):
    root[i*i] = i

a, b, c = list(map(int, input().split()))

sq = 2*a + 2*b + 2*c + (a*c)/b + (a*b)/c + (b*c)/a

if sq in root:
    print(4*root[sq])
else:
    print('Boo')
