import sys

import collections

import math



n = int(eval(input()))

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



R = [0] * n



idx = 0

for i in range(n-1, -1, -2):

    R[idx] = A[i]

    idx += 1



for i in range(n % 2, n, +2):

    R[idx] = A[i]

    idx += 1



print((" ".join([str(i) for i in R])))



sys.exit(0)



import sys

import collections

import math

from collections import Counter

from collections import deque



n = int(eval(input()))

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



Q = deque()



f = True

if n % 2 == 0:

    f = not f



for a in A:

    if f:

        Q.appendleft(a)

    else:

        Q.append(a)

    f = not f



print((" ".join([str(q) for q in Q])))



sys.exit(0)

import sys
import collections
import math

n = int(eval(input()))
A = [int(x) for x in input().split()]
R = [0] * n
idx = 0
for i in range(n - 1, -1, -2):
    R[idx] = A[i]
    idx += 1
for i in range(n % 2, n, +2):
    R[idx] = A[i]
    idx += 1
print((" ".join([str(i) for i in R])))
sys.exit(0)

import sys
import collections
import math
from collections import Counter
from collections import deque

n = int(eval(input()))
A = [int(x) for x in input().split()]
Q = deque()
f = True
if n % 2 == 0:
    f = not f
for a in A:
    if f:
        Q.appendleft(a)
    else:
        Q.append(a)
    f = not f
print((" ".join([str(q) for q in Q])))
sys.exit(0)

+from collections import Counter +from collections import deque -R = [0] * n -idx = 0 -for i in range(n - 1, -1, -2): -    R[idx] = A[i] -    idx += 1 -for i in range(n % 2, n, +2): -    R[idx] = A[i] -    idx += 1 -print((" ".join([str(i) for i in R]))) +Q = deque() +f = True +if n % 2 == 0: +    f = not f +for a in A: +    if f: +        Q.appendleft(a) +    else: +        Q.append(a) +    f = not f +print((" ".join([str(q) for q in Q])))