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.
l = list(map(int,input().split(' ')))
l = sorted(l)
for i in range(1,l[0]+1):
    if l[0]%i == 0 and l[1]%i == 0:
        b = l[0]/i
        c = l[1]/i
        if l[2] == b*c:
            print(int(4*(i+b+c)))
            break
