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.
import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

a, b, c = map(int, input().split())
for i in range(1, a + 1):
    j = a // i
    k = b // j
    if i * j == a and j * k == b and k * i == c:
        ans = 4 * (i + j + k)
        break
print(ans)