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.

areas = input().split()

for a in range(1, int(areas[0]) + 1):
    if int(areas[0]) % a == 0:
        b = int(int(areas[0]) / a)
        for c in range(1, int(areas[1]) + 1):
            if b * c == int(areas[1]):
                if a * c == int(areas[2]):
                    print(((a*2) + (b*2) + (c*2)) *2)


