Codeforces Round #395 (Div. 2) B

Description

Young Timofey has a birthday today! He got kit of n cubes as a birthday present from his parents. Every cube has a number ai, 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 whilei ≤ 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·105) — the number of cubes.

The second line contains n integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109), where ai 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.

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

题意：给我们交换后的数组，告诉我们交换规则1~n中（1,n交换,2,n-1交换....）,然后是2~n-1中（2,n-1交换......）,直到中间位置，问我们初始数组是怎么排列的

解法：偶数位置是不动的，奇数位置需要调换就好了

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 #define ll long long
 4 int main()
 5 {
 6     int b[300000];
 7     int n;
 8     //vector<int>q;
 9     cin>>n;
10     int a[300000];
11     for(int i=1; i<=n; i++)
12     {
13         cin>>a[i];
14     }
15     if(n%2)
16     {
17         for(int i=1;i<=n/2;i++)
18         {
19             if(i&1)
20             {
21                 swap(a[i],a[n-i+1]);
22             }
23         }
24         for(int i=1;i<=n;i++)
25         {
26             cout<<a[i]<<" ";
27         }
28     }
29     else if(n!=2&&n%2==0)
30     {
31         for(int i=1;i<=n/2;i++)
32         {
33             if(i&1)
34             {
35                 swap(a[i],a[n-i+1]);
36             }
37         }
38         for(int i=1;i<=n;i++)
39         {
40             cout<<a[i]<<" ";
41         }
42     }
43     else
44     {
45         cout<<a[2]<<" "<<a[1]<<endl;
46     }
47     return 0;
48 }

 

转载于:https://www.cnblogs.com/yinghualuowu/p/6602064.html