from heapq import heappop,heappush
N = int(input())
V = list(map(int,input().split()))
V.sort()
while True:
    print(V)
    if len(V) == 1:
        break
    a = heappop(V)
    print(V)
    b = heappop(V)
    heappush(V,(a + b) / 2)
print(heappop(V))