from collections import Counter,defaultdict,deque

import sys,heapq,bisect,math,itertools,string,queue

sys.setrecursionlimit(10**8)

mod = 10**9+7

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))

def inpl_str(): return list(sys.stdin.readline().split())

def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))



n = inp()

a = inpl()

if n%2:

    for i in range(n)[::-2]:

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

    for i in range(1,n)[::2]:

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

    print()

else:

    for i in range(n)[::-2]:

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

    for i in range(n)[::2]:

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

    print()

    

from collections import Counter,defaultdict,deque

from heapq import heappop,heappush,heapify

import sys,bisect,math,itertools

sys.setrecursionlimit(10**8)

mod = 10**9+7

mod2 = 998244353

INF = float('inf')

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))

def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))



n = inp()

a = inpl()

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

    print((a[i]))

if n%2:

    j = 1

else:

    j = 0

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

    print((a[i]))
from collections import Counter, defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue

sys.setrecursionlimit(10**8)
mod = 10**9 + 7


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


def inpl_str():
    return list(sys.stdin.readline().split())


def inpln(n):
    return list(int(sys.stdin.readline()) for i in range(n))


n = inp()
a = inpl()
if n % 2:
    for i in range(n)[::-2]:
        print(a[i], end=" ")
    for i in range(1, n)[::2]:
        print(a[i], end=" ")
    print()
else:
    for i in range(n)[::-2]:
        print(a[i], end=" ")
    for i in range(n)[::2]:
        print(a[i], end=" ")
    print()

from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools

sys.setrecursionlimit(10**8)
mod = 10**9 + 7
mod2 = 998244353
INF = float("inf")


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


def inpln(n):
    return list(int(sys.stdin.readline()) for i in range(n))


n = inp()
a = inpl()
for i in range(n - 1, -1, -2):
    print((a[i]))
if n % 2:
    j = 1
else:
    j = 0
for i in range(j, n, 2):
    print((a[i]))

-import sys, heapq, bisect, math, itertools, string, queue +from heapq import heappop, heappush, heapify +import sys, bisect, math, itertools +mod2 = 998244353 +INF = float("inf") -def inpl_str(): -    return list(sys.stdin.readline().split()) - - +for i in range(n - 1, -1, -2): +    print((a[i])) -    for i in range(n)[::-2]: -        print(a[i], end=" ") -    for i in range(1, n)[::2]: -        print(a[i], end=" ") -    print() +    j = 1 -    for i in range(n)[::-2]: -        print(a[i], end=" ") -    for i in range(n)[::2]: -        print(a[i], end=" ") -    print() +    j = 0 +for i in range(j, n, 2): +    print((a[i]))