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

def sumPerimeter(a, b, c):
    return (4*a) + (4*b) + (4*c)

(f1, f2, f3) = tuple(map(int,input().split()))
if f1 != 1 and f2 != 1 and f3 != 1:
    #f1 = a * c
    #f2 = a * b
    #f3 = b * c

    c = math.sqrt(((f3 * f1)/ f2))
    b = ((f2 * c) / f1)
    a = f1 / c
    print(sumPerimeter(a,b,c))
else:
    print(3*4)

 	 		 	   						 	 		   	  		