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.
areas = list(map(int,input().split()))
#formula provided after some 
# manipulation for each sides
side1 = ((areas[0]*areas[1])/areas[2])**0.5
side2 = ((areas[0]*areas[2])/areas[1])**0.5
side3 = ((areas[1]*areas[1])/areas[0])**0.5
print(int(4*(side1+side2+side3)))