Codeforces Round 395 (Div. 2)
B
Timofey and cubes
Codeforces
900
原题
← AC →
翻译中…

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.

翻译中…

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$].
翻译中…

样例

Input #1
7
4 3 7 6 9 1 2
Output #1
2 3 9 6 7 1 4
InputCopy OutputCopy
Input #2
8
6 1 4 2 5 6 9 2
Output #2
2 1 6 2 5 4 9 6
InputCopy OutputCopy
题目信息
题号
764B
时间限制
1 s
内存限制
256 MB
标签
构造
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。