from collections import deque

n = int(eval(input()))

v = sorted(map(float, input().split()))

ans = 0

v = deque(v)

while(len(v) > 1):

    v.appendleft(((v.popleft() + v.popleft()) / 2))

print((v[0]))
n = int(eval(input()))

v = sorted(map(float, input().split()))

ans = v[0]

for i in range(n - 1):

    ans = (ans + v[i + 1]) / 2

print(ans)

from collections import deque

n = int(eval(input()))
v = sorted(map(float, input().split()))
ans = 0
v = deque(v)
while len(v) > 1:
    v.appendleft(((v.popleft() + v.popleft()) / 2))
print((v[0]))

n = int(eval(input()))
v = sorted(map(float, input().split()))
ans = v[0]
for i in range(n - 1):
    ans = (ans + v[i + 1]) / 2
print(ans)

-from collections import deque - -ans = 0 -v = deque(v) -while len(v) > 1: -    v.appendleft(((v.popleft() + v.popleft()) / 2)) -print((v[0])) +ans = v[0] +for i in range(n - 1): +    ans = (ans + v[i + 1]) / 2 +print(ans)