import numpy as np

n = int(eval(input()))

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



b = np.zeros(n, dtype='int')



cnt = 0

if n % 2 == 0:

    for i in range(n // 2):

        left_idx = n // 2 - 1 - i

        right_idx = n // 2 + i

        b[left_idx] = 2 * i + 1

        b[right_idx] = 2 * i + 2

    b = b[::-1]

else:

    for i in range(n // 2):

        left_idx = n // 2 - i

        right_idx = n // 2 + 1 + i

        b[left_idx] = 2 * i + 1

        b[right_idx] = 2 * i + 2

    b[0] = n

# print('b', b)



for i in a[[b - 1]]:

    print(i)

from collections import deque

n = int(input())

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



d = deque()

for i, v in enumerate(a):

    if i % 2 == 0:

        d.appendleft(v)

    else:

        d.append(v)

if i % 2 == 1:

    d = list(d)[::-1]

print(*d, sep=' ')

import numpy as np

n = int(eval(input()))
a = np.array(list(map(int, input().split())))
b = np.zeros(n, dtype="int")
cnt = 0
if n % 2 == 0:
    for i in range(n // 2):
        left_idx = n // 2 - 1 - i
        right_idx = n // 2 + i
        b[left_idx] = 2 * i + 1
        b[right_idx] = 2 * i + 2
    b = b[::-1]
else:
    for i in range(n // 2):
        left_idx = n // 2 - i
        right_idx = n // 2 + 1 + i
        b[left_idx] = 2 * i + 1
        b[right_idx] = 2 * i + 2
    b[0] = n
# print('b', b)
for i in a[[b - 1]]:
    print(i)

from collections import deque

n = int(input())
a = list(map(int, input().split()))
d = deque()
for i, v in enumerate(a):
    if i % 2 == 0:
        d.appendleft(v)
    else:
        d.append(v)
if i % 2 == 1:
    d = list(d)[::-1]
print(*d, sep=" ")

-import numpy as np +from collections import deque -n = int(eval(input())) -a = np.array(list(map(int, input().split()))) -b = np.zeros(n, dtype="int") -cnt = 0 -if n % 2 == 0: -    for i in range(n // 2): -        left_idx = n // 2 - 1 - i -        right_idx = n // 2 + i -        b[left_idx] = 2 * i + 1 -        b[right_idx] = 2 * i + 2 -    b = b[::-1] -else: -    for i in range(n // 2): -        left_idx = n // 2 - i -        right_idx = n // 2 + 1 + i -        b[left_idx] = 2 * i + 1 -        b[right_idx] = 2 * i + 2 -    b[0] = n -# print('b', b) -for i in a[[b - 1]]: -    print(i) +n = int(input()) +a = list(map(int, input().split())) +d = deque() +for i, v in enumerate(a): +    if i % 2 == 0: +        d.appendleft(v) +    else: +        d.append(v) +if i % 2 == 1: +    d = list(d)[::-1] +print(*d, sep=" ")