It is Sunny's birthday! (again!) So Jono gave him an array $a = [a_0,a_1,\dots,a_{n-1}]$ as a birthday present. Sunny is thankful for the gift. He decided to modify the array, and give it back to Jono in return.

Denote the modified array as $b = [b_0,b_1,\dots,b_{n-1}]$, where $b_i = a_i + a_{n-i-1}$. Find $b$.

Input

The first line contains an integer $N (1 \le N \le 10^6)$ — the size of the array $a$.
The second line consists of $N$ integers $a_0,a_1,\dots,a_{n-1}(0 \le a_i \le 2^{31}-1)$ — the elements of array $a$.

Output

Print $N$ integers separated by spaces — the elements of array $b$.

Sample Test Cases

Input Output
6
6 3 2 0 1 4
10 4 2 2 4 10
5
6 9 4 2 0
6 11 8 11 6
Click to copy.

Scoring: Per Case
Authored by s17l37