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.
from math import sqrt, ceil

area = [int(x) for x in input().split()]

side = []
for i in range(1, ceil(sqrt(area[0])) + 1):
    if area[0]% i == 0:
        j = area[0]/i
        if area[1]%i == 0 and area[2]%j == 0:
            side = [i, j, area[i]/i]
            break
        elif area[1]%i == 0 and area[2]%j == 0:
            side = [i, j, area[i]/i]
            break

print(int(4*sum(side)))
