Odd or Even

Odd or Even is a game two players use to settle random questions (for example, "who has to solve this problem?"). In one version, before playing each player calls out either odds or evens. The players then count to three, and on three both simultaneously hold out one hand showing from zero to five fingers. If the total number of fingers is even, the player who called evens wins; if the total is odd, the player who called odds wins.

John and Mary played several games of Odd or Even. In every game John called odds, so Mary always had evens. After each game both players recorded, on a small card, how many fingers they had shown — Mary wrote on blue cards and John on red cards — so they could review the results later. At the end of the day John dropped the whole deck. They could still sort the cards by color, but within each color the cards are now shuffled and the original game-by-game pairing is lost.

Given the multiset of numbers on the red cards and the multiset of numbers on the blue cards, write a program that determines the minimum number of games Mary is guaranteed to have won.

The input contains several test cases. The first line of each test case has an integer $N$, the number of games played ($1 \le N \le 100$). The second line has $N$ integers $X_i$, the number of fingers Mary showed in each game ($0 \le X_i \le 5$). The third line has $N$ integers $Y_i$, the number of fingers John showed in each game ($0 \le Y_i \le 5$). A line containing a single $0$ marks the end of the input and must not be processed.

For each test case, print a single line with one integer: the minimum number of games Mary is guaranteed to have won.