eolymp
bolt
Try our new interface for solving problems
Problems

Print array 3

Print array 3

Array of n integers is given. Print all its positive elements, do not change their initial order.

Input

First line contains number n (1n100). Second line contains n integers, each no more than 100 by absolute value.

Output

In the first line print the number of positive elements in array. In the second line print the positive elements. If there are no positive elements in the array, print "NO".

Time limit 1 second
Memory limit 128 MiB
Input example #1
7
-2 5 4 -3 7 -3 0
Output example #1
3
5 4 7
Input example #2
5
-2 -1 0 -1 -5
Output example #2
NO
Author Matviychuk Sergiy Volodymyrovych
Source "ABC programming"