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.
a,b,c=map(int,input().split())
l=[]
r1=0
r2=0
r3=0
for i in range(2,((a//2)+1)):
    if(a%i==0):
        l.append(i)
        l.append(a//2)
        r1=1
        break
if(r1==0):
    l.append(a)
    l.append(1)
for i in range(2,((b//2)+1)):
    if(b%i==0):
        l.append(i)
        l.append(b//2)
        r2=1
        break
if(r2==0):
    l.append(b)
    l.append(1)
for i in range(2,((c//2)+1)):
    if(c%i==0):
        l.append(i)
        l.append(c//2)
        r3=1
        break
if(r3==0):
    l.append(c)
    l.append(1)
r=0
for i in range(len(l)):
    r=r+l[i]
print(2*r)