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.
def main():
    values = input()
    values = values.split()
    values[0] = int(values[0])
    values[1] = int(values[1])
    values[2] = int(values[2])
    print(int(4*values[1]/(values[1]*values[2]/values[0])**(1/2)) +
          int(4*values[2]/(values[1]*values[2]/values[0])**(1/2)) +
          int(4*(values[1]*values[2]/values[0])**(1/2))) 
main()  


		 				 		 			 	    		   	 		 	