It is audit day at the mulberry rows of Silkmead. Lata spreads the coins records across the table and picks up a sharp pencil. 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 <= 646; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 646; 0 <= a[i] <= 10; answers fit a signed 64-bit integer.
