Score : $200$ points
Takahashi has $N$ blue cards and $M$ red cards. A string is written on each card. The string written on the $i$-th blue card is $s_i$, and the string written on the $i$-th red card is $t_i$.
Takahashi will now announce a string, and then check every card. Each time he finds a blue card with the string announced by him, he will earn $1$ yen (the currency of Japan); each time he finds a red card with that string, he will lose $1$ yen.
Here, we only consider the case where the string announced by Takahashi and the string on the card are exactly the same. For example, if he announces atcoder, he will not earn money even if there are blue cards with atcoderr, atcode, btcoder, and so on. (On the other hand, he will not lose money even if there are red cards with such strings, either.)
At most how much can he earn on balance?
Note that the same string may be written on multiple cards.
Input is given from Standard Input in the following format:
$N$ $s_1$ $s_2$ $:$ $s_N$ $M$ $t_1$ $t_2$ $:$ $t_M$
If Takahashi can earn at most $X$ yen on balance, print $X$.
3 apple orange apple 1 grape
2
He can earn $2$ yen by announcing apple.
3 apple orange apple 5 apple apple apple apple apple
1
If he announces apple, he will lose $3$ yen. If he announces orange, he can earn $1$ yen.
1 voldemort 10 voldemort voldemort voldemort voldemort voldemort voldemort voldemort voldemort voldemort voldemort
0
If he announces voldemort, he will lose $9$ yen. If he announces orange, for example, he can avoid losing a yen.
6 red red blue yellow yellow red 5 red red yellow green blue
1