CodeForces - 764B Timofey and cubes

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⁵) — the number of cubes.

The second line contains n integers a₁, a₂, ..., a_n ( - 10⁹ ≤ a_i ≤ 10⁹), 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.

Example

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.

1. At the begining row was [2, 3, 9, 6, 7, 1, 4].
2. After first operation row was [4, 1, 7, 6, 9, 3, 2].
3. After second operation row was [4, 3, 9, 6, 7, 1, 2].
4. After third operation row was [4, 3, 7, 6, 9, 1, 2].

1. 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].

题目大意：对于给定的一个序列进行操作，序列长度为n，进行操作，第i步操作即是把从第i起到第n-i+1的数进行翻转，保证2*i<=n+1;并且进行输出

题目分析：由于答案不唯一，进行模拟运算可以发现，第i个数若为偶数，即和第n-i+1的数进行调换，否则就保持不变。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 100005*2;
long long a[maxn],b[maxn];
int main(){
	int n;
	long long k;
	while((scanf("%d",&n))!=EOF){
		int i;
		for(i=1;i<=n;i++)
		   scanf("%lld",&a[i]);
		   i=1;
        while(i<=n-i+1){
        	if(i%2 == 1)
         swap(a[i],a[n-i+1]);
         i++;
		}
		for(i=1;i<n;i++){
			printf("%lld ",a[i]);
		}
		printf("%lld\n",a[n]);
	}
	return 0;
}