def C_pushpush(x):

    from collections import deque

    # insertをリストの先頭に行うと、リストの要素の再配置に時間がかかる

    n = int(x[0])

    a = deque(x[1:])

    b = deque([])

    n_parity = n & 1

    for i in range(n):

        if n_parity == (i + 1) & 1:

            # n,iのパリティが一致

            b.appendleft(a[i])

        else:

            b.append(a[i])

    print((' '.join(b)))



n = eval(input())

l = [i for i in input().split()]

x = [n]+l

C_pushpush(x)
def c_pushpush(N,A):

    from collections import deque

    # insertをリストの先頭に行うと、リストの要素の再配置に時間がかかる

    b = deque([])

    n_parity = N & 1

    for i in range(N):

        if n_parity == (i + 1) & 1:

            # n,iのパリティが一致

            b.appendleft(A[i])

        else:

            b.append(A[i])

    ans = ' '.join(map(str,b))

    return ans



N = int(eval(input()))

A = [int(i) for i in input().split()]

print((c_pushpush(N,A)))
def C_pushpush(x):
    from collections import deque

    # insertをリストの先頭に行うと、リストの要素の再配置に時間がかかる
    n = int(x[0])
    a = deque(x[1:])
    b = deque([])
    n_parity = n & 1
    for i in range(n):
        if n_parity == (i + 1) & 1:
            # n,iのパリティが一致
            b.appendleft(a[i])
        else:
            b.append(a[i])
    print((" ".join(b)))


n = eval(input())
l = [i for i in input().split()]
x = [n] + l
C_pushpush(x)

def c_pushpush(N, A):
    from collections import deque

    # insertをリストの先頭に行うと、リストの要素の再配置に時間がかかる
    b = deque([])
    n_parity = N & 1
    for i in range(N):
        if n_parity == (i + 1) & 1:
            # n,iのパリティが一致
            b.appendleft(A[i])
        else:
            b.append(A[i])
    ans = " ".join(map(str, b))
    return ans


N = int(eval(input()))
A = [int(i) for i in input().split()]
print((c_pushpush(N, A)))

-def C_pushpush(x): +def c_pushpush(N, A): -    n = int(x[0]) -    a = deque(x[1:]) -    n_parity = n & 1 -    for i in range(n): +    n_parity = N & 1 +    for i in range(N): -            b.appendleft(a[i]) +            b.appendleft(A[i]) -            b.append(a[i]) -    print((" ".join(b))) +            b.append(A[i]) +    ans = " ".join(map(str, b)) +    return ans -n = eval(input()) -l = [i for i in input().split()] -x = [n] + l -C_pushpush(x) +N = int(eval(input())) +A = [int(i) for i in input().split()] +print((c_pushpush(N, A)))