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())
f1=[]
for i in range(1,int(a**0.5)+1):
    if a%i==0:
        f1.append(i)
        if i*i!=a:
            f1.append(a//i)
for item in f1:
    x=item
    y=a//item
    if b%y==0:
        z=b//y
        if x*z==c:
            break
    if c%y==0:
        z=c//y
        if z*x==b:
            break
print(4*(x+y+z))