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.
A1, A2, A3=map(int,input().split())
for L in range(1, A1 + 1):
        if A1 % L == 0:
            W = A1 // L
            for H in range(1, A2 + 1):
                if A2 % H == 0:
                    if A3 == W * H:
                        print( 4 * (L + W + H))
