A Very Big Sum

Source: HackerRank

Version: Phuoc Hung OJ Extended

Problem Statement

Given an array of $n$ non-negative integers, some values can be large enough that their total exceeds the signed 32-bit integer range.

Compute

and print the exact value of $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\le10$ and $0\le a_i\le10^{10}$. The total always fits in signed 64-bit long long.

Examples

Input

5
1000000001 1000000002 1000000003 1000000004 1000000005

Output

5000000015

Explanation

The five values sum to $5000000015$. This is larger than $2^{31}-1$, so a type wider than signed 32-bit int is required.