The paymaster Seth has been asked to tally the donation drive. On the desk lies a long table of lanterns readings. Task: Read n integers and print how many are even. Input format: First line: n. Second line: n space-separated integers. Output format: Print the count of even values. Constraints: 1 <= n <= 443; 0 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 443; 0 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
