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.
a, b, c = map(int, input().split())

def get_perimeter(a, b, c):
    for i in range(1, a+1):
        if a % i == 0 and b % i == 0 and (a/i) * (b/i) == c:
            return 4*(i + b//i + c//(b//i))
    return -1
print(get_perimeter(a, b, c))