from collections import deque





def main():

    n, *a = open(0).read().split()

    dq = deque()

    n = int(n) - 1

    for i, ai in enumerate(a):

        if i % 2 == n % 2:

            dq.appendleft(ai)

        else:

            dq.append(ai)

    print((" ".join(dq)))

    return





main()

def main():

    n, *a = open(0).read().split()

    if int(n) % 2:

        print(" ".join(reversed(a[0::2])), end=" ")

        print(" ".join(a[1::2]))

    else:

        print(" ".join(reversed(a[1::2])), end=" ")

        print(" ".join(a[0::2]))

    return





main()

from collections import deque


def main():
    n, *a = open(0).read().split()
    dq = deque()
    n = int(n) - 1
    for i, ai in enumerate(a):
        if i % 2 == n % 2:
            dq.appendleft(ai)
        else:
            dq.append(ai)
    print((" ".join(dq)))
    return


main()

def main():
    n, *a = open(0).read().split()
    if int(n) % 2:
        print(" ".join(reversed(a[0::2])), end=" ")
        print(" ".join(a[1::2]))
    else:
        print(" ".join(reversed(a[1::2])), end=" ")
        print(" ".join(a[0::2]))
    return


main()

-from collections import deque - - -    dq = deque() -    n = int(n) - 1 -    for i, ai in enumerate(a): -        if i % 2 == n % 2: -            dq.appendleft(ai) -        else: -            dq.append(ai) -    print((" ".join(dq))) +    if int(n) % 2: +        print(" ".join(reversed(a[0::2])), end=" ") +        print(" ".join(a[1::2])) +    else: +        print(" ".join(reversed(a[1::2])), end=" ") +        print(" ".join(a[0::2]))