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 math

def getSide(firstArea, secondArea, thirdArea):
    return int(math.sqrt((firstArea*secondArea)//thirdArea))

a1, a2, a3 = [int(k) for k in input().split()]
a = getSide(a1, a3, a2)
b = getSide(a1, a2, a3)
c = getSide(a2, a3, a1)

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