In the mining town of Ironvein, Lakshya the measurer keeps careful count of the scrolls. outscore the rival chapter, every figure matters. 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 <= 650; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 650; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.
