Pairing Socks

Simone's mother often complains that Simone never helps with chores at home. In return, Simone often points out that many of the chores her mother assigns are NP-complete to perform optimally (cleaning the house, seating her little brothers around the dinner table in a conflict-free way, splitting the brothers' Halloween loot fairly, and so on).

Being a computer scientist, her mother finds this a fair objection. Looking over her list of potential chores, she picked one she thinks should be easy to solve: pairing a number of different kinds of socks.

In the beginning, there are $2n$ socks stacked in a pile. To pair the socks, Simone can repeatedly make one of three moves:

1. Move the sock from the top of the original pile to the top of an auxiliary pile (which is originally empty).
2. Move the sock from the top of the auxiliary pile to the top of the original pile.
3. Pair the top socks from each pile together, if they are of the same type.

Simone only has one auxiliary pile, for a total of two piles. There may be more than two socks of each type. In this case, Simone can pair them up however she wants.

Your task is to help Simone determine the least number of moves she needs to pair the socks, if it is possible at all.

The first line of input contains the integer $n$ ($1 \le n \le 10^5$) as described above.

The next line contains $2n$ integers $a_1, \dots, a_{2n}$ ($1 \le a_i \le 10^9$ for each $i$), where $a_i$ denotes the type of sock number $i$. Initially, sock 1 is at the top of the pile and sock $2n$ is at the bottom.

If Simone can pair all the socks, output the least number of moves she needs to do this. If it is impossible to do so, output impossible.