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 calculate_sum(a,b,c):
    return 4*a + 4*b + 4*c


def get_edges(areaA, areaB, areaC):
    a = (areaA*areaB/areaC)**(1/2)
    b = (areaB*areaC/areaA)**(1/2)
    c = (areaC*areaA/areaB)**(1/2)
    return {'a': a, 'b': b, 'c': c}


def main():
    areas = input()
    splitAreas = areas.split(" ")
    obj = get_edges(int(splitAreas[0]), int(splitAreas[1]), int(splitAreas[2]))
    print(obj)
    sum = calculate_sum(obj['a'], obj['b'], obj['c'])
    print(int(sum))


if __name__ == "__main__":
    main()

