The log keeper Mason has been asked to schedule the next expedition. On the desk lies a long table of ingots readings. Task: Read n integers and print how many are strictly positive. Input format: First line: n. Second line: n space-separated integers. Output format: Print the count of positive values. Constraints: 1 <= n <= 702; 0 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 702; 0 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
