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.
listt=list(map(int,input().split(' ',2)))
listt=sorted(listt)
pas=0
for m in range(listt[0],0,-1):
    if listt[0]%m==0 and pas==0:
        new=[]
        key1=listt[0]/m
        key2=m
        new.append(key1)
        new.append(key2)
        if listt[1]%key1==0 and (key2*listt[1]/key1)==listt[2]:
                pas=1
                new.append(listt[1]/key1)
        elif listt[1]%key2==0 and (key1*listt[2]/key2)==listt[2]:
                pas=1
                new.append(listt[1]/key2)

print(int((new[0]*4)+(new[1]*4)+(new[2]*4)))

