CyberStars

Sum Array

Read an integer N, then read N integers. Print their sum.

Input

  • First line: an integer N (1 <= N <= 2·10^4)
  • The next N lines: one integer per line (-10^7 <= x <= 10^7)
  • The sum, and every partial sum along the way, fits in an int (-2·10^9 <= sum <= 2·10^9)

Output

A single integer: the sum of all N numbers.

Examples

Input:
5
1
2
3
4
5
Output: 15
Input:
3
10
-3
7
Output: 14
Input:
1
7
Output: 7
Input:
3
-1
-2
-3
Output: -6