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.
elements = [int(x) for x in input().split()]
edge_len = []
def search_gcd(a ,b):
    if a < b:
        a, b = b ,a
    while b != 0:
        r = a % b
        a = b
        b = r
    return a
elements = sorted(elements)
edge_len.append(search_gcd(elements[0], elements[2]))
edge_len.append(elements[0]/edge_len[0])
edge_len.append(elements[2]/edge_len[0])
print(round(4 * sum(edge_len)))