def c_alchemist():
    N = int(input())
    V = [int(i) for i in input().split()]
    v = sorted(V, reverse=True)
    while len(v) > 1:
        x = v.pop()
        y = v.pop()
        v.append((x + y) / 2)
    return sum(v)