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 = input().split()

area1 = int(areas[0])
area2 = int(areas[1])
area3 = int(areas[2])

height = int(pow(area3*area2/area1,0.5))
width = int(area1*height/area2)
length = int(area1/width)

print(4*(height + width + length))



