Build a Prefix Sum Array


Submit solution

Points: 100
Time limit: 2.0s
Memory limit: 256M

Author:
Problem types

Construct \(F\) where \(F_i=A_1+A_2+...+A_i\) for every \(1<=i<=N\).

Input

The first line contains \(N\). The second line contains \(N\) integers \(A_i\).

The input satisfies:

  • \(1 \le N \le 1000\)
  • \(0 \le A_i \le 1000\)

Output

Print \(F_1,F_2,...,F_N\) separated by single spaces.

Example

Input
1
4
Output
4

Comments

There are no comments at the moment.