from queue import deque



n = int(eval(input()))

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



b = deque()



for i in range(n):

    if i%2 == 0:

        b.append(a[i])

    else:

        b.appendleft(a[i])



ans = list(b)



if n%2 != 0:

    ans = ans[::-1]



print((*ans))
from collections import deque

n = int(eval(input()))

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

B = deque()



for i in range(n):

    if i%2 == 0:

        B.append(A[i])

    else:

        B.appendleft(A[i])

B = list(B)        

if n%2 != 0:

    B = B[::-1]

print((*B))



from queue import deque

n = int(eval(input()))
a = list(map(int, input().split()))
b = deque()
for i in range(n):
    if i % 2 == 0:
        b.append(a[i])
    else:
        b.appendleft(a[i])
ans = list(b)
if n % 2 != 0:
    ans = ans[::-1]
print((*ans))

from collections import deque

n = int(eval(input()))
A = list(map(int, input().split()))
B = deque()
for i in range(n):
    if i % 2 == 0:
        B.append(A[i])
    else:
        B.appendleft(A[i])
B = list(B)
if n % 2 != 0:
    B = B[::-1]
print((*B))

-from queue import deque +from collections import deque -a = list(map(int, input().split())) -b = deque() +A = list(map(int, input().split())) +B = deque() -        b.append(a[i]) +        B.append(A[i]) -        b.appendleft(a[i]) -ans = list(b) +        B.appendleft(A[i]) +B = list(B) -    ans = ans[::-1] -print((*ans)) +    B = B[::-1] +print((*B))