Dịch trái một vị trí (Cyclic Left Shift by One)

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

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

Perform one cyclic left shift: the first element moves to the end, and every other element moves one position to the left.

Let the resulting array be $b$. For $n\ge2$,

and

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

Print $b$.

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 one cyclic left shift 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

20 30 40 50 10

Explanation

Elements at positions $2$ through $5$ move one position left, while $10$ moves to the end.