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())

def is_sqrt(num):
    test = num ** 0.5
    return test % 1 == 0
test = set()
test.add(a)
test.add(b)
test.add(c)

if len(test) == 1:
    print(a * 12)
elif len(test) == 2:
    print(test.pop() // 2 * 4 + test.pop() // 2 * 4 + 8)

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