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

lul = input().split()

lul = [int(i) for i in lul]

x = lul[0]
y = lul[1]
z = lul[2]

a = math.sqrt((x*y)/z);
b = math.sqrt((x*z)/y);
c = math.sqrt((y*z)/x);
val=(a+b+c)*4;
print(int(val))
 			  			   		  	  		    		  	