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.
if __name__ == "__main__":
    areas = input().split(" ")
    areas[0] = int(areas[0])
    areas[1] = int(areas[1])
    areas[2] = int(areas[1])
    
    length = ((areas[0]*areas[2])/areas[1])**(1/2)
    breadth = ((areas[0]*areas[1])/areas[2])**(1/2)
    height = ((areas[1]*areas[2])/areas[0])**(1/2)
    
    print(4*(length+breadth+height))