Couple Breaker Minwook (Small)

In the Small version, output only 1 of the possible arrangements.

Minwook, the Couple Breaker, is single, so he dislikes seeing couples together. He finds a waiting line of $N$ people standing in a row. He will split this line into $M$ groups and then reorder the groups so that no two members of a couple stand next to each other. However, he cannot reverse the order of people within a group or rearrange them. The groups may have different sizes.

If $M$ is large, reordering the groups becomes a headache for Minwook, so he wants $M$ to be as small as possible. For the minimum $M$, he wants to find just one of the possible arrangements.

The first line contains an integer $N$ ($1 \le N \le 10^{3}$), the number of people.

The second line contains integers $a_{1}, a_{2}, a_{3}, \cdots, a_{N}$ ($0 \le a_{i} \le 10^{3}$), separated by spaces. $a_{i}$ describes the person standing at position $i$ from the front. If $a_i = 0$, that person is single. If $a_i = a_j$ and $a_i \ne 0$, persons $i$ and $j$ are a couple. Every nonzero value appears exactly twice in $a_{1}, a_{2}, a_{3}, \cdots, a_{N}$.

On the first line, print the minimum value of $M$.

On the second line, print the number of people in group 1, group 2, ..., group $M$, separated by spaces.

On the third line, print the group numbers from the front of the line after the groups are reordered.

If every way of splitting the line into groups and arranging them leaves at least one couple adjacent, print $-1$ on the first line and nothing after it.