Mira runs the brewery at the pine barrens of Needlepoint. Today the books show a list of tickets, and the numbers must be worked out before sundown. 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 <= 285; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 285; -1000000 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
