Reverse-copy x into y

Source: Phuoc Hung OJ

Version: Phuoc Hung OJ Extended

Problem

Given a source array $X=(x_0,\ldots,x_{n-1})$, construct a separate destination array $Y$ without modifying $X$, such that

This is reverse-copy: $Y$ is the reverse of $X$ while $X$ remains unchanged.

Input

The first line contains $n$. The second line contains $X$.

Output

Print unchanged $X$ on the first line and reverse-copy $Y$ on the second line.

Subtask

Subtask 1 (20 points): $1\le n\le10$.

Subtask 2 (30 points): $1\le n\le100$.

Subtask 3 (50 points): $1\le n\le1000$.

Example

Input

5
3 1 4 1 5

Output

3 1 4 1 5
5 1 4 1 3

Explanation

Each destination index reads the symmetric source index.