The tallyman Tanya has been asked to price the new merchandise line. On the desk lies a long table of ingots readings. 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 <= 505; 0 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 505; 0 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
