【codeforces 764B】Timofey and cubes 题解

【codeforces 764B】Timofey and cubes 题解

题目

题目链接: http://codeforces.com/problemset/problem/764/B

B. Timofey and cubes

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

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

题目大意

奇数位交换，偶数位不变。

题解

直接操作数组交换下就好了。

当然也可以找规律直接输出，那时写的时候我找了半个小时还没写好最后终测还wa了别提多尴尬了。果然弱鸡不作不死啊T_T。

代码

//2017-02-02-21.49
//B

#include <bits/stdc++.h>
using namespace std;

int d[200000 + 100];

int main()
{
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) scanf("%d", &d[i]);
    for (int i = 0; i < n / 2; i++)
    {
        if (i % 2 == 0) swap(d[i], d[n - i - 1]);
    }
    for (int i = 0; i < n; i++)
    {
        printf("%d ", d[i]);
    }
    puts("");
}