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 as mp
def parallelepiped(areas):
    print(areas[0],areas[1],areas[2])
    a=areas[0]/areas[1]
    b2=mp.sqrt(areas[2]/a)
    a1=areas[1]/b2
    b1=areas[0]/a1
    edge_sum=(4*a1)+(4*b1)+(4*b2)
    return(int(edge_sum))

areas=list(map(int,input().split()))
result=parallelepiped(areas)
print(result)
