An energy company monitors a long pipeline using n flow sensors mounted one after another, from the source end of the pipeline out to the far end. Each sensor reports a signed integer reading (flow can briefly reverse, giving a negative value). To understand how much net fluid has moved through the pipeline up to any given point, the engineers want, for every sensor position, the running total of every reading from the source-side sensor up through that sensor.

Input format

• Line 1: a single integer n, the number of sensors.
• Line 2: n space-separated integers measurements[0], measurements[1], ..., measurements[n-1], the reading at each sensor in order from the source end.

Output format

Print n space-separated integers ans[0], ans[1], ..., ans[n-1], where ans[i] equals the sum of measurements[0] through measurements[i] inclusive.

Constraints

• 1 <= n <= 10000
• -1000000 <= measurements[i] <= 1000000

5
1 2 3 4 5

1 3 6 10 15

4
1 1 1 1

1 2 3 4