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.
def edges_sum(n1,n2,n3):
  X=(n3*n1/n2)**(1/2)
  Y=n1/X
  Z=n2/Y
  return round(4*X+4*Y+4*Z)
n=list(map(int, input().split()))
states=[[0,1,2],[0,2,1],[1,0,2],[1,2,0],[2,1,0],[2,0,1]]
for s in states:
  try:
    print(edges_sum(n[s[0]],n[s[1]],n[s[2]]))
    break
  except:
    pass


 	 	   		 				 	 		   		    	 	