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 *

def solve(vetor):
    [a,b,c] = vetor
    lado1 = sqrt(a * c / b)
    lado2 = c / lado1
    lado3 = a / lado1
    return int(4*(lado1+lado2+lado3))   
 
vetor = list(map(int,input().split()))
print(solve(vetor))

   			 					 	 		  			   		