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.
A, B, C = [int(x) for x in input().split()]

#cada aresta distinta do paralelepipedo pode ser calculada da seguinte forma: raiz das 2 areas distintas dividido pela terceira area, sempre alternando o numerador e o denominador
#a soma de todas as arestas se da pelos 3 lados distintos multiplicado por 4

a = int((A*B//C)**0.5)

b = int((B*C//A)**0.5)

c = int((A*C//B)**0.5)

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