CF1152A.Neko Finds Grapes

On a random day, Neko found $n$ treasure chests and $m$ keys. The $i$ -th chest has an integer $a_i$ written on it and the $j$ -th key has an integer $b_j$ on it. Neko knows those chests contain the powerful mysterious green Grapes, thus Neko wants to open as many treasure chests as possible.

The $j$ -th key can be used to unlock the $i$ -th chest if and only if the sum of the key number and the chest number is an odd number. Formally, $a_i + b_j \equiv 1 \pmod{2}$ . One key can be used to open at most one chest, and one chest can be opened at most once.

Find the maximum number of chests Neko can open.

The first line contains integers $n$ and $m$ ( $1 \leq n, m \leq 10^5$ ) — the number of chests and the number of keys.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $1 \leq a_i \leq 10^9$ ) — the numbers written on the treasure chests.

The third line contains $m$ integers $b_1, b_2, \ldots, b_m$ ( $1 \leq b_i \leq 10^9$ ) — the numbers written on the keys.

Print the maximum number of chests you can open.

In the first example, one possible way to unlock $3$ chests is as follows:

• Use first key to unlock the fifth chest,
• Use third key to unlock the second chest,
• Use fourth key to unlock the first chest.

In the second example, you can use the only key to unlock any single chest (note that one key can't be used twice).

In the third example, no key can unlock the given chest.