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.
s = input().split()
a = int(s[0])
b = int(s[1])
c = int(s[2])
ans = 0
for i in range(1, 10001):
    if a % i == 0 and b % i == 0 and c % i == 0:
        x = a // i
        if b // i == c // x:
            y = b // i
            ans = (x + y + i) * 4
            break
        elif b // x == c // i:
            y = b // x
            ans = (x + y + i) * 4
            break
print(ans)