from collections import deque

N = int(input())
v = list(map(int, input().split()))
v.reverse()
V = deque(v)
sum = 0
while True:
    sum = (V.popleft() + V.popleft())/2
    V.append(sum)
    if len(V) == 1:
        break

print(V[0])
