CF1326B.Maximums

Alicia has an array, $a_1, a_2, \ldots, a_n$, of non-negative integers. For each $1 \leq i \leq n$, she has found a non-negative integer $x_i = max(0, a_1, \ldots, a_{i-1})$. Note that for $i=1$, $x_i = 0$.

For example, if Alicia had the array $a = {0, 1, 2, 0, 3}$, then $x = {0, 0, 1, 2, 2}$.

Then, she calculated an array, $b_1, b_2, \ldots, b_n$: $b_i = a_i - x_i$.

For example, if Alicia had the array $a = {0, 1, 2, 0, 3}$, $b = {0-0, 1-0, 2-1, 0-2, 3-2} = {0, 1, 1, -2, 1}$.

Alicia gives you the values $b_1, b_2, \ldots, b_n$ and asks you to restore the values $a_1, a_2, \ldots, a_n$. Can you help her solve the problem?

艾丽西亚有一个由非负整数构成的数组 $a_1, a_2, \ldots, a_n$。对每个 $1 \leq i \leq n$，她计算出一个非负整数 $x_i = \max(0, a_1, \ldots, a_{i-1})$。注意：当 $i=1$ 时，$x_i = 0$。

例如，若艾丽西亚的数组为 $a = \{0, 1, 2, 0, 3\}$，则 $x = \{0, 0, 1, 2, 2\}$。

接着，她计算出另一个数组 $b_1, b_2, \ldots, b_n$：$b_i = a_i - x_i$。

例如，若艾丽西亚的数组为 $a = \{0, 1, 2, 0, 3\}$，则
$b = \{0-0,\ 1-0,\ 2-1,\ 0-2,\ 3-2\} = \{0,\ 1,\ 1,\ -2,\ 1\}$。

艾丽西亚将 $b_1, b_2, \ldots, b_n$ 的值给你，并请你还原出原始数组 $a_1, a_2, \ldots, a_n$。你能帮她解决这个问题吗？

The first line contains one integer $n$ ($3 \leq n \leq 200\,000$) – the number of elements in Alicia's array.

The next line contains $n$ integers, $b_1, b_2, \ldots, b_n$ ($-10^9 \leq b_i \leq 10^9$).

It is guaranteed that for the given array $b$ there is a solution $a_1, a_2, \ldots, a_n$, for all elements of which the following is true: $0 \leq a_i \leq 10^9$.

第一行包含一个整数 $n$（$3 \leq n \leq 200\,000$）——表示 Alicia 数组中的元素个数。

下一行包含 $n$ 个整数 $b_1, b_2, \ldots, b_n$（$-10^9 \leq b_i \leq 10^9$）。

保证对于给定的数组 $b$，存在一个解 $a_1, a_2, \ldots, a_n$，使得所有元素均满足：$0 \leq a_i \leq 10^9$。

Print $n$ integers, $a_1, a_2, \ldots, a_n$ ($0 \leq a_i \leq 10^9$), such that if you calculate $x$ according to the statement, $b_1$ will be equal to $a_1 - x_1$, $b_2$ will be equal to $a_2 - x_2$, ..., and $b_n$ will be equal to $a_n - x_n$.

It is guaranteed that there exists at least one solution for the given tests. It can be shown that the solution is unique.

输出 $n$ 个整数 $a_1, a_2, \ldots, a_n$（其中 $0 \leq a_i \leq 10^9$），使得根据题面描述计算出 $x$ 后，满足 $b_1 = a_1 - x_1$，$b_2 = a_2 - x_2$，……，$b_n = a_n - x_n$。

保证给定的测试数据至少存在一个解。可以证明该解是唯一的。

The first test was described in the problem statement.

In the second test, if Alicia had an array $a = {1000, 1000000000, 0}$, then $x = {0, 1000, 1000000000}$ and $b = {1000-0, 1000000000-1000, 0-1000000000} = {1000, 999999000, -1000000000}$.

第一个测试用例已在题目描述中给出。

在第二个测试用例中，若 Alicia 拥有数组 $a = {1000, 1000000000, 0}$，则 $x = {0, 1000, 1000000000}$，且 $b = {1000-0, 1000000000-1000, 0-1000000000} = {1000, 999999000, -1000000000}$。