import math

import sys

input = sys.stdin.readline



n = int(input())

a = list(map(int, input().split()))

be = []

af = []

for i in range(math.floor(n/2)):

    be.append(a[n-(2*i)-1])

    af.append(a[n-(2*i)-2])

af.reverse()

if n%2 == 1:

    ans = be + [a[0]] + af

else:

    ans = be + af

for i in range(n):

    print(ans[i], end=' ')

print('\n')

import sys

read = sys.stdin.buffer.read

readline = sys.stdin.buffer.readline

readlines = sys.stdin.buffer.readlines

sys.setrecursionlimit(10 ** 7)



from collections import deque



n, *a = list(map(int, read().split()))

b = deque()

v = 1 if n % 2 == 0 else 0

for i, aa in enumerate(a):

    if i % 2 == v:

        b.appendleft(aa)

    else:

        b.append(aa)

print((*b))

import math
import sys

input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
be = []
af = []
for i in range(math.floor(n / 2)):
    be.append(a[n - (2 * i) - 1])
    af.append(a[n - (2 * i) - 2])
af.reverse()
if n % 2 == 1:
    ans = be + [a[0]] + af
else:
    ans = be + af
for i in range(n):
    print(ans[i], end=" ")
print("\n")

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
from collections import deque

n, *a = list(map(int, read().split()))
b = deque()
v = 1 if n % 2 == 0 else 0
for i, aa in enumerate(a):
    if i % 2 == v:
        b.appendleft(aa)
    else:
        b.append(aa)
print((*b))

-import math -input = sys.stdin.readline -n = int(input()) -a = list(map(int, input().split())) -be = [] -af = [] -for i in range(math.floor(n / 2)): -    be.append(a[n - (2 * i) - 1]) -    af.append(a[n - (2 * i) - 2]) -af.reverse() -if n % 2 == 1: -    ans = be + [a[0]] + af -else: -    ans = be + af -for i in range(n): -    print(ans[i], end=" ") -print("\n") +read = sys.stdin.buffer.read +readline = sys.stdin.buffer.readline +readlines = sys.stdin.buffer.readlines +sys.setrecursionlimit(10**7) +from collections import deque + +n, *a = list(map(int, read().split())) +b = deque() +v = 1 if n % 2 == 0 else 0 +for i, aa in enumerate(a): +    if i % 2 == v: +        b.appendleft(aa) +    else: +        b.append(aa) +print((*b))