There are n integers b₁,b₂,...,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₁,a₂,...,a_n, and he now wants you to find the initial numbers b₁,b₂,...,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⁹≤a_i≤10⁹)− the value of the i'th number.

Print n integers corresponding to the sequence b₁,b₂,...,b_n. It's guaranteed that the answer is unique and fits in 32-bit integer type.