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

area_a = int(entrada[0])
area_b = int(entrada[1])
area_c = int(entrada[2])

lado_a = area_a**0.5
lado_b = area_b / lado_a

soma_lado_a = (lado_a*4)*2
soma_lado_b = lado_b*4

soma_total = soma_lado_a + soma_lado_b

if soma_total % 1 == 0:
    print(int(soma_total))
else:
    print(soma_total)
    	 				 			   	 	 		   	 			