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()))

a = int(((l[0]*l[2])//l[1])**0.5)
b = int(((l[0]*l[1])//l[2])**0.5)
c = int(((l[1]*l[2])//l[0])**0.5)

print(4*(a+b+c))
