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 math

def solve(areas):

    if (math.sqrt(areas[0])).is_integer():
        base = math.sqrt(areas[0])
        num_1 = areas[1]
        num_2 = areas[2]
    elif (math.sqrt(areas[1])).is_integer():
        base = math.sqrt(areas[1])
        num_1 = areas[0]
        num_2 = areas[2]
    else:
        base = math.sqrt(areas[2])
        num_1 = areas[0]
        num_2 = areas[1]

    result = (base * 8) + ((num_1 / base) * 2) + ((num_2 / base) * 2)
    return result


areas = [int(num) for num in input().split()]
result = solve(areas)
print(int(result))


