Dịch phải một vị trí (Cyclic Right Shift by One)

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given an integer array $a_0,a_1,\ldots,a_{n-1}$.

Perform exactly one cyclic right shift. The last element moves to the first position, and every other element moves one position to the right.

Let the resulting array be $b$. For $n\ge 2$:

and for every $i$ such that $1\le i<n$:

For $n=1$, the array remains unchanged.

Print $b$.

Input

The first line contains integer $n$. The second line contains $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print the $n$ elements after one cyclic right shift on one line.

Subtask

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 10 20 30 40

Explanation

The value $50=a_4$ moves to index $0$; every other element moves exactly one position to the right.