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.
from math import gcd

faces = input().split()
faces = [int(x) for x in faces]

vex_a = gcd(faces[0], faces[1])
vex_b = faces[0]/vex_a
vex_c = faces[1]/vex_a
print(int(vex_a *4 + vex_b*4 + vex_c*4))
   		 	   	     	 	  		   	   	