from collections import deque



N = int(eval(input()))

A = [int(i) for i in input().split()]



Q = deque()



for i, a in enumerate(A):

    if i % 2 == 0:

        Q.append(a)

    else:

        Q.appendleft(a)



if N % 2 == 1:

    Q.reverse()

print((*Q))

from collections import deque



N = int(eval(input()))

A = [int(i) for i in input().split()]



print((*A[::-2] + A[N % 2::2]))

from collections import deque

N = int(eval(input()))
A = [int(i) for i in input().split()]
Q = deque()
for i, a in enumerate(A):
    if i % 2 == 0:
        Q.append(a)
    else:
        Q.appendleft(a)
if N % 2 == 1:
    Q.reverse()
print((*Q))

from collections import deque

N = int(eval(input()))
A = [int(i) for i in input().split()]
print((*A[::-2] + A[N % 2 :: 2]))

-Q = deque() -for i, a in enumerate(A): -    if i % 2 == 0: -        Q.append(a) -    else: -        Q.appendleft(a) -if N % 2 == 1: -    Q.reverse() -print((*Q)) +print((*A[::-2] + A[N % 2 :: 2]))