Loại các số âm, giữ nguyên thứ tự (Remove Negative Numbers While Preserving Order)

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given an integer array $a_0,a_1,\ldots,a_{n-1}$.

Remove every negative element, i.e. every $a_i<0$. Zero and positive values must remain. The relative order of retained elements must not change.

Define

If $I=\{i_0<i_1<\cdots<i_{m-1}\}$, then

Print $m$ and $b$.

Input

The first line contains integer $n$. The second line contains exactly $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print the remaining size $m$ on the first line. If $m>0$, print the resulting array on the second line.

Subtask

Subtask 1 (100 points): $1\le n\le2\cdot10^5$; $|a_i|\le10^9$.

Example

Input

5
-2 0 5 -1 3

Output

3
0 5 3

Explanation

The negative values $-2$ and $-1$ are removed; $0,5,3$ remain in their original relative order.