A10480 | Memory and Crow

There are $n$ integers $b_{1},b_{2},...,b_{n}$ written in a row. For all $i$ from $1$ to $n$ , values $a_{i}$ are defined by the crows performing the following procedure:

- The crow sets $a_{i}$ initially $0$ .
- The crow then adds $b_{i}$ to $a_{i}$ , subtracts $b_{i+1}$ , adds the $b_{i+2}$ number, and so on until the $n$ 'th number. Thus, $a_{i}=b_{i}-b_{i+1}+b_{i+2}-b_{i+3}...$ .

Memory gives you the values $a_{1},a_{2},...,a_{n}$ , and he now wants you to find the initial numbers $b_{1},b_{2},...,b_{n}$ written in the row? Can you do it?

The first line of the input contains a single integer $n$ ( $2<=n<=100000$ ) — the number of integers written in the row.

The next line contains $n$ , the $i$ 'th of which is $a_{i}$ ( $-10^{9}<=a_{i}<=10^{9}$ ) — the value of the $i$ 'th number.

Print $n$ integers corresponding to the sequence $b_{1},b_{2},...,b_{n}$ . It's guaranteed that the answer is unique and fits in 32-bit integer type.