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.
ab,bc,ca = map(int,input().split())

a = []
c = []

for i in range(1,int(ab**0.5)+1):
    if ab%i==0:
        a.append(i)
        if i**i !=ab:
            a.append(ab//i)

for j in range(1,int(bc**0.5)+1):
    if bc%j==0:
        c.append(j)
        if j**j !=bc:
            c.append(bc//j)


for k in a:
    for l in c:
        m = ab//k
        if k*l == ca and m*l==bc:
            print(4*(k+l+m))