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.
c=0
n=[int(n) for n in input().split()]
if n[0]>1:
    x1=n[0]//2
    x3=0
    if n[1]%x1==0:
        x3=n[1]//x1
        print(4*(x1+x3+2))
    else:
        print(4**(2+2+x1))
else:
    print(12)