n = int(eval(input()))

a = input().split()

b = []

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

  b.extend([a[i]])

for j in range(n % 2, n, 2):

  b.extend([a[j]])

print((" ".join(b)))

import os

import sys

from collections import deque



if os.getenv("LOCAL"):

    sys.stdin = open("_in.txt", "r")



sys.setrecursionlimit(2147483647)

INF = float("inf")

IINF = 10 ** 18

MOD = 10 ** 9 + 7



N = int(sys.stdin.readline())

A = list(map(int, sys.stdin.readline().split()))



que = deque()

for i in range(N):

    if i % 2 == 0:

        que.append(A[i])

    else:

        que.appendleft(A[i])

if N % 2:

    que.reverse()

print((*que))

n = int(eval(input()))
a = input().split()
b = []
for i in range(n - 1, -1, -2):
    b.extend([a[i]])
for j in range(n % 2, n, 2):
    b.extend([a[j]])
print((" ".join(b)))

import os
import sys
from collections import deque

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))
que = deque()
for i in range(N):
    if i % 2 == 0:
        que.append(A[i])
    else:
        que.appendleft(A[i])
if N % 2:
    que.reverse()
print((*que))

-n = int(eval(input())) -a = input().split() -b = [] -for i in range(n - 1, -1, -2): -    b.extend([a[i]]) -for j in range(n % 2, n, 2): -    b.extend([a[j]]) -print((" ".join(b))) +import os +import sys +from collections import deque + +if os.getenv("LOCAL"): +    sys.stdin = open("_in.txt", "r") +sys.setrecursionlimit(2147483647) +INF = float("inf") +IINF = 10**18 +MOD = 10**9 + 7 +N = int(sys.stdin.readline()) +A = list(map(int, sys.stdin.readline().split())) +que = deque() +for i in range(N): +    if i % 2 == 0: +        que.append(A[i]) +    else: +        que.appendleft(A[i]) +if N % 2: +    que.reverse() +print((*que))