h2. Date de intrare

The first line of the input file $christmas-balls.in$ contains the only integer $N$ $1 ≤ N ≤ 10^5$, the number of nodes of the tree.

The first line of the input file $christmas-balls.in$ contains the only integer $N$, $1 ≤ N ≤ 10^5$, the number of nodes of the tree.

The second line contains $N$ integers $C_i$ $0 &le; C_i < N$, the colors of each ball.

For tests worth $13$ points, the tree is a line.

For tests worth $15$ more points, ($1 ≤ N ≤ 1000$), ($1 ≤ MAXC ≤ 2$).

For tests worth $15$ more points, $1 ≤ N ≤ 1000$, $1 ≤ MAXC ≤ 2$.

For tests worth $21$ more points, ($1 ≤ N ≤ 1000$).

For tests worth $21$ more points, $1 ≤ N ≤ 1000$.

For tests worth $17$ more points, ($1 ≤ MAXC ≤ 2$).

For tests worth $17$ more points, $1 ≤ MAXC ≤ 2$.

h2. Date de ieşire