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.
import io,os,sys
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

def solve():
    a = list(map(int,input().split()))
    return 4 * sum([int(((a[list({0,1,2} - {i})[0]]*a[list({0,1,2} - {i})[1]])//a[i])**(1/2)) for i in range(3)])

sys.stdout.write(str(solve())+'\n')