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])



if n % 2 == 0:

    print((*B))

else:

    B = list(B)

    print((*(B[::-1])))
import sys

# import numpy as np

from collections import Counter, deque



sys.setrecursionlimit(10 ** 7)

f_inf = float('inf')

mod = 10 ** 9 + 7





def resolve():

    n = int(eval(input()))

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

    B = deque([])



    if n % 2 == 0:

        for i in range(n):

            a = deque.popleft(A)

            if i % 2 == 0:

                B.append(a)

            else:

                B.appendleft(a)

    else:

        for i in range(n):

            a = deque.popleft(A)

            if i % 2 != 0:

                B.append(a)

            else:

                B.appendleft(a)

    print((" ".join(map(str, B))))





if __name__ == '__main__':

    resolve()

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])
if n % 2 == 0:
    print((*B))
else:
    B = list(B)
    print((*(B[::-1])))

import sys

# import numpy as np
from collections import Counter, deque

sys.setrecursionlimit(10**7)
f_inf = float("inf")
mod = 10**9 + 7


def resolve():
    n = int(eval(input()))
    A = deque(list(map(int, input().split())))
    B = deque([])
    if n % 2 == 0:
        for i in range(n):
            a = deque.popleft(A)
            if i % 2 == 0:
                B.append(a)
            else:
                B.appendleft(a)
    else:
        for i in range(n):
            a = deque.popleft(A)
            if i % 2 != 0:
                B.append(a)
            else:
                B.appendleft(a)
    print((" ".join(map(str, B))))


if __name__ == "__main__":
    resolve()

-from collections import deque +import sys -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]) +# import numpy as np +from collections import Counter, deque + +sys.setrecursionlimit(10**7) +f_inf = float("inf") +mod = 10**9 + 7 + + +def resolve(): +    n = int(eval(input())) +    A = deque(list(map(int, input().split()))) +    B = deque([]) +    if n % 2 == 0: +        for i in range(n): +            a = deque.popleft(A) +            if i % 2 == 0: +                B.append(a) +            else: +                B.appendleft(a) -        B.appendleft(A[i]) -if n % 2 == 0: -    print((*B)) -else: -    B = list(B) -    print((*(B[::-1]))) +        for i in range(n): +            a = deque.popleft(A) +            if i % 2 != 0: +                B.append(a) +            else: +                B.appendleft(a) +    print((" ".join(map(str, B)))) + + +if __name__ == "__main__": +    resolve()