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 Parallelepiped():
    import math
    area_of_3_sides = input().split(' ')
    area_of_3_sides = [eval(i) for i in area_of_3_sides]
    xy = area_of_3_sides[0]
    yz = area_of_3_sides[1]
    xz = area_of_3_sides[2]

    x = math.sqrt((xy*xz)/yz)
    y = math.sqrt((yz*xy)/xz)
    z = math.sqrt((yz*xz)/xy)

    sum_of_all_edges = (x+y+z)*4
    print(int(sum_of_all_edges))


Parallelepiped()