from collections import deque

N = int(eval(input()))

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

if N%2==0:

    queue = deque()

    for i in range(0, N, 2):

        queue.append(A[i])

        queue.appendleft(A[i+1])

else:

    queue = deque([A[0]])

    for i in range(1, N, 2):

        queue.append(A[i])

        queue.appendleft(A[i+1])



print((*queue))





    

    
N = int(eval(input()))

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

if N&1:

    ans = A[::2][::-1] + A[1::2]

else:

    ans = A[1::2][::-1] + A[::2]

print((*ans))
from collections import deque

N = int(eval(input()))
A = [int(x) for x in input().split()]
if N % 2 == 0:
    queue = deque()
    for i in range(0, N, 2):
        queue.append(A[i])
        queue.appendleft(A[i + 1])
else:
    queue = deque([A[0]])
    for i in range(1, N, 2):
        queue.append(A[i])
        queue.appendleft(A[i + 1])
print((*queue))

N = int(eval(input()))
A = [int(x) for x in input().split()]
if N & 1:
    ans = A[::2][::-1] + A[1::2]
else:
    ans = A[1::2][::-1] + A[::2]
print((*ans))

-from collections import deque - -if N % 2 == 0: -    queue = deque() -    for i in range(0, N, 2): -        queue.append(A[i]) -        queue.appendleft(A[i + 1]) +if N & 1: +    ans = A[::2][::-1] + A[1::2] -    queue = deque([A[0]]) -    for i in range(1, N, 2): -        queue.append(A[i]) -        queue.appendleft(A[i + 1]) -print((*queue)) +    ans = A[1::2][::-1] + A[::2] +print((*ans))