The harbor bell rings at the spice bazaar of Saffronia; Qadir weighs the day's tickets manifests and starts the calculations. Task: Read n integers and print the sum of all even values. Input format: First line: n. Second line: n space-separated integers. Output format: Print the sum of even values (0 if none). Constraints: 1 <= n <= 96; -1000000 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 96; -1000000 <= a[i] <= 1000; answers fit a signed 64-bit integer.
