n = int(eval(input()))

a = [int(x) for x in input().split()]



b_even = [x for n, x in enumerate(a) if (n+1) % 2 == 0]

b_odd = [x for n, x in enumerate(a) if (n+1) % 2 == 1]



if n % 2 == 0:

    b_even.reverse()

    res = b_even + b_odd

else:

    b_odd.reverse()

    res = b_odd + b_even



print((*res))
n = int(eval(input()))

a = input().split()



if n % 2 == 0:

    b = a[::-2] + a[::2]

else:

    b = a[::-2] + a[1::2]



print((*b))
n = int(eval(input()))
a = [int(x) for x in input().split()]
b_even = [x for n, x in enumerate(a) if (n + 1) % 2 == 0]
b_odd = [x for n, x in enumerate(a) if (n + 1) % 2 == 1]
if n % 2 == 0:
    b_even.reverse()
    res = b_even + b_odd
else:
    b_odd.reverse()
    res = b_odd + b_even
print((*res))

n = int(eval(input()))
a = input().split()
if n % 2 == 0:
    b = a[::-2] + a[::2]
else:
    b = a[::-2] + a[1::2]
print((*b))

-a = [int(x) for x in input().split()] -b_even = [x for n, x in enumerate(a) if (n + 1) % 2 == 0] -b_odd = [x for n, x in enumerate(a) if (n + 1) % 2 == 1] +a = input().split() -    b_even.reverse() -    res = b_even + b_odd +    b = a[::-2] + a[::2] -    b_odd.reverse() -    res = b_odd + b_even -print((*res)) +    b = a[::-2] + a[1::2] +print((*b))