The scribe Trader has been asked to optimize the storeroom layout. On the desk lies a long table of stamps readings. Task: Read n integers and print their total sum. Input format: First line: n. Second line: n space-separated integers. Output format: Print the sum of all n values. Constraints: 1 <= n <= 714; -1000000 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 714; -1000000 <= a[i] <= 1000; answers fit a signed 64-bit integer.
