from collections import deque

n, l, b = eval(input()), input().split(), deque()

for t in range(n):

    b.append(l[t]) if (t + 1) % 2 else b.appendleft(l[t])

print(' '.join(reversed(b)) if n % 2 else ' '.join(b))
n, l = eval(input()), input().split()

print(' '.join(l[0::2][::-1] + l[1::2]) if len(l) % 2 else ' '.join(l[1::2][::-1] + l[0::2]))
from collections import deque

n, l, b = eval(input()), input().split(), deque()
for t in range(n):
    b.append(l[t]) if (t + 1) % 2 else b.appendleft(l[t])
print(" ".join(reversed(b)) if n % 2 else " ".join(b))

n, l = eval(input()), input().split()
print(
    " ".join(l[0::2][::-1] + l[1::2])
    if len(l) % 2
    else " ".join(l[1::2][::-1] + l[0::2])
)

-from collections import deque - -n, l, b = eval(input()), input().split(), deque() -for t in range(n): -    b.append(l[t]) if (t + 1) % 2 else b.appendleft(l[t]) -print(" ".join(reversed(b)) if n % 2 else " ".join(b)) +n, l = eval(input()), input().split() +print( +    " ".join(l[0::2][::-1] + l[1::2]) +    if len(l) % 2 +    else " ".join(l[1::2][::-1] + l[0::2]) +)