Simple Array Sum

Source: HackerRank

Version: Phuoc Hung OJ Extended

Problem Statement

Given an integer array $A=(a_0,a_1,\ldots,a_{n-1})$, compute the sum of all elements:

Print $S$.

Input

• The first line contains $n$.
• The second line contains $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print one integer: the sum $S$.

Subtasks

Subtask 1 (100 points): $1\le n\le1000$ and $0\le a_i\le1000$.

Examples

Input

6
1 2 3 4 10 11

Output

31

Explanation

Adding the elements gives $1+2+3+4+10+11=31$, so the program prints 31.