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
from itertools import combinations


def gd(a: int):
    for div in reversed(range(3, a // 2 + 1, 2)):
        if a % div == 0:
            return div
    if a % 2 == 0:
        return 2
    return 1


areas = map(int, input().split())
result = int()
for area in combinations(areas, 2):
    if area[0] != area[1]:
        result += math.gcd(*area) * 4
    else:
        result += gd(area[0]) * 4
print(result)
