In the magical world of , the information is stored in prefix sum arrays. This helps them move faster and saves time. Yet, they sometimes lose the initial information and get stuck. Can you help them restore the initial array given the prefix sum?
The first line of the input contains a single integer
n- the number of elements in the array (1 ≤ n ≤ ). The next line contains
nintegers separated by a space, that represent the elements of the prefix sum .
The program should print
nspace-separated integers representing the initial array.
8 8 11 9 13 23 22 22 27
8 3 -2 4 10 -1 0 5