Young Timofey has a birthday today! He got kit of n cubes as a birthday present from his parents. Every cube has a number a_{i}, which is written on it. Timofey put all the cubes in a row and went to unpack other presents.

In this time, Timofey's elder brother, Dima reordered the cubes using the following rule. Suppose the cubes are numbered from 1 to n in their order. Dima performs several steps, on step i he reverses the segment of cubes from i-th to (n - i + 1)-th. He does this while i ≤ n - i + 1.

After performing the operations Dima went away, being very proud of himself. When Timofey returned to his cubes, he understood that their order was changed. Help Timofey as fast as you can and save the holiday — restore the initial order of the cubes using information of their current location.


-----Input-----

The first line contains single integer n (1 ≤ n ≤ 2·10^5) — the number of cubes.

The second line contains n integers a_1, a_2, ..., a_{n} ( - 10^9 ≤ a_{i} ≤ 10^9), where a_{i} is the number written on the i-th cube after Dima has changed their order.


-----Output-----

Print n integers, separated by spaces — the numbers written on the cubes in their initial order.

It can be shown that the answer is unique.


-----Examples-----
Input
7
4 3 7 6 9 1 2

Output
2 3 9 6 7 1 4
Input
8
6 1 4 2 5 6 9 2

Output
2 1 6 2 5 4 9 6


-----Note-----

Consider the first sample.  At the begining row was [2, 3, 9, 6, 7, 1, 4].  After first operation row was [4, 1, 7, 6, 9, 3, 2].  After second operation row was [4, 3, 9, 6, 7, 1, 2].  After third operation row was [4, 3, 7, 6, 9, 1, 2].  At fourth operation we reverse just middle element, so nothing has changed. The final row is [4, 3, 7, 6, 9, 1, 2]. So the answer for this case is row [2, 3, 9, 6, 7, 1, 4].

Difficulty: interview

Starter code:

Solutions:
n = int(input())
a = list(map(int, input().split()))
i = 1
while i <= n - i + 1:
    if i % 2:
        a[i - 1], a[-i] = a[-i], a[i - 1]
    i += 1
print(*a)


n = int(input())
a = [0 for i in range(n)]
b = [0 for i in range(n)]
inp = input().split()
for i in range(n):
    a[i] = int(inp[i])

for i in range(0, (n + 1) // 2):
    if i % 2:
        b[i] = a[i]
        b[n - i - 1] = a[n - i - 1]
    else:
        b[i] = a[n - i - 1]
        b[n - i - 1] = a[i]
    #print(b)

print(" ".join(str(i) for i in b))


n = int(input())
l = list(map(int, input().split()))
for i in range(0, n // 2, 2):
    l[i], l[n - i - 1] = l[n - i - 1], l[i]
print(*l)

n = int(input())
a = list(map(int, input().split()))
p = n // 2
t = p % 2
for i in range(t, len(a) // 2, 2):
	a[i], a[n - i - 1] = a[n - i - 1], a[i]
if n // 2 % 2:
	a = a[::-1]
for i in a:
	print(i, end = ' ')

n=int(input())
ip=list(map(int,input().split()))
for i in range(n//2):
    if i%2==0:
        ip[i],ip[n-i-1]=ip[n-i-1],ip[i]
    else:
        continue
for i in ip:
    print(i,end=' ')


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

for i in range(n // 2):
	if not (i & 1):
		a[i], a[-i - 1] = a[-i - 1], a[i]

print(' '.join(map(str, a)))


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

for i in range(n//2):
    if i % 2 == 0:
        t = a[i]
        a[i] = a[n-i-1]
        a[n-i-1] = t

print(*a)


n = int(input())
a = list(map(int,input().split()))
# if n%2 == 0:
#     for i in range(n//2):
#         if i%2 == 0:
#             print(a[-i-1], end = ' ')
#         else:
#             print(a[i], end = ' ')
for i in range(n//2):
    if (i%2 == 0):
        a[i],a[n-i-1] = a[n-i-1],a[i]
for i in a:
    print(i,end= ' ')
print('')    

n = int(input())
arr = input().split()
if(n%2 == 1):
	for i in range(n):
		if(i%2 == 1):
			print(arr[i], end=" ")
		else:
			print(arr[(n-1)-i], end=" ")
else:
	for i in range(n//2):
		if(i%2 == 1):
			print(arr[i], end=" ")
		else:
			print(arr[(n-1)-i], end=" ")
	for i in range(n//2,n):
		if(i%2 == 0):
			print(arr[i], end=" ")
		else:
			print(arr[(n-1)-i], end=" ")

n = int(input())
a = list(map(int, input().split()))
for i in range(0, n // 2, 2):
    a[i], a[-i - 1] = a[-i - 1], a[i]
print(*a)

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

for i in range(n//2):
    if (i+1) % 2:
        a[i], a[n-1-i] = a[n-1-i], a[i]

for i in range(n):
    print(a[i], end=' ')




def main():
    n = int(input())
    a = list(map(int, input().split()))
    for i in range(n // 2):
        if i % 2 == 0:
            a[i], a[n - i - 1] = a[n - i - 1], a[i]
    print(*a)

main()

import math


def ria():
    return [int(i) for i in input().split()]


n = ria()[0]

ar = ria()
for i in range(0, n//2, 2):
    ar[i], ar[n - i - 1] = ar[n - i - 1], ar[i]

for i in ar:
    print(i,end=' ')

def main():
    n = int(input())
    arr = list(map(int, input().split()))
    for i in range(0, n // 2, 2):
        temp = arr[i]
        arr[i] = arr[n - i - 1]
        arr[n - i - 1] = temp
    for i in range(n):
        print(arr[i], end = ' ')
main()

n = int(input())
a = list(map(int, input().split()))
for i in range(0, n//2,2):
    a[i], a[n - i - 1] = a[n - i - 1],a[i]
for i in a:
    print(i, end = ' ')

n=int(input())
l=list(map(int,input().split()))
i = 0
while i < n - i - 1:
	if i % 2 == 0:
		l[i],l[n-i-1]=l[n-i-1],l[i]
	i+=1
for i in range(n):
	print(l[i],end=' ')

n = int(input())

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

for i in range(n // 2):
    if i % 2 == 0:
        a[i], a[-i - 1] = a[-i - 1], a[i]

print(*a)


import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()


def main():
    n = II()
    a = LI()
    for i in range(0,n,2):
        j = n-i-1
        if j <= i:
            break
        a[i], a[j] = a[j], a[i]
    return " ".join(map(str, a))

print(main())


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

for i in range(0, n // 2, 2):
	a[i], a[n - i - 1] = a[n - i - 1], a[i]
	
print(' '.join([str(el) for el in a]))

def r():
	return list(map(int, input().split()))
n = int(input())
a = r()
for i in range((n + 1)// 2):
	if i & 1:
		continue
	tmp = a[i]
	a[i] = a[n - i - 1]
	a[n - i - 1] = tmp
print(' '.join(str(i) for i in a))

n = int(input())
A = list(map(int, input().split()))
for i in range(n//2):
    if i % 2 == 0:
        A[i], A[n-i-1] = A[n-i-1], A[i]
for i in A:
    print(i, sep = '', end = ' ')


n = int(input())
l = list(map(int, input().split()))
newl = []
if n % 2 == 0:
    rev = n // 2
else:
    rev = n // 2 + 1
flag = 1
t = n - 1
for i in range(rev):
    flag *= -1
    if flag == -1:
        newl.append(l[t])
        t -= 1
    else:
        newl.append(l[n - t - 1])
        t -= 1
t = 0
flag = -1
help = []
for i in range(rev):
    flag *= -1
    if flag == -1:
        help.append(l[n - t - 1])
    else:
        help.append(l[t])
    t += 1
if n % 2 == 0:
    newl = newl + help[::-1]
else:
    newl = newl[:-1] + help[::-1]

print(*newl)

n = int(input().strip())
a = input().strip().split()

for i in range(n // 2):
    if i % 2 == 0:
        a[i], a[n - i - 1] = a[n - i - 1], a[i]

print(' '.join(a))


n = int(input())
z = list(map(int, input().strip().split()))
for i in range(n // 2):
    if i % 2 == 0:
        z[i], z[n - i - 1] = z[n - i -1], z[i]
print(' '.join(list(map(str, z))))