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.
l = list(map(int,input().split()))
A1 = l[0]
A2 = l[1]
A3 = l[2]
A1S = []
for i in range(1,int(A1**.5)+1):
    if A1 % i == 0 :
        A1S.append((i,A1/i))
for i in A1S :
    if A2 % i[0] == 0 and A3 % i[1] == 0 :
        l1 = i[0]
        l2 = i[1]
        l3 = A2 // i[0]
        break
    elif A2 % i[1] == 0 and A3 % i[0] == 0 :
        l1 = i[0]
        l2 = i[1]
        l3 = A2 // i[1]
        break
print((l1+l2+l3)*4)