Đảo mảng tại chỗ - n chẵn/lẻ (In-place Array Reversal - Even/Odd Length)

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given an integer array $a_1,a_2,\ldots,a_n$.

Reverse it in place by swapping symmetric pairs

for

When $n$ is odd, the middle element at index $(n+1)/2$ is never moved by a swap.

Print the array after all swaps.

Input

The first line contains integer $n$. The second line contains $n$ space-separated integers $a_1,a_2,\ldots,a_n$.

Output

Print the $n$ elements after the in-place reversal on one line.

Subtasks

Subtask 1 (100 points): $1\le n\le 2\cdot 10^5$; $|a_i|\le 10^9$.

Example

Input

5
10 20 30 40 50

Output

50 40 30 20 10

Explanation

Swap $(a_1,a_5)$ and $(a_2,a_4)$. The middle element $a_3=30$ remains in place.