CF489B.BerSU Ball

The Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary! n boys and m girls are already busy rehearsing waltz, minuet, polonaise and quadrille moves.

We know that several boy&girl pairs are going to be invited to the ball. However, the partners' dancing skill in each pair must differ by at most one.

For each boy, we know his dancing skills. Similarly, for each girl we know her dancing skills. Write a code that can determine the largest possible number of pairs that can be formed from n boys and m girls.

伯兰国立大学正在举办一场舞会，以庆祝其成立100500周年！已有 $n$ 名男生和 $m$ 名女生正忙着排练华尔兹、小步舞、波洛奈兹和四对舞等舞步。

已知将有多对男女组合被邀请参加舞会。然而，每对组合中男女双方的舞蹈技能之差至多为 $1$。

我们已知每位男生的舞蹈技能水平；同样，也已知每位女生的舞蹈技能水平。请编写一段代码，计算从 $n$ 名男生和 $m$ 名女生中最多能组成多少对满足条件的组合。

The first line contains an integer n (1 ≤ n ≤ 100) — the number of boys. The second line contains sequence _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 100), where a__i is the i-th boy's dancing skill.

Similarly, the third line contains an integer m (1 ≤ m ≤ 100) — the number of girls. The fourth line contains sequence _b_1, _b_2, ..., b__m (1 ≤ b__j ≤ 100), where b__j is the j-th girl's dancing skill.

第一行包含一个整数 $n$（$1 \leq n \leq 100$）—— 男孩的数量。
第二行包含序列 $a_1, a_2, \dots, a_n$（$1 \leq a_i \leq 100$），其中 $a_i$ 表示第 $i$ 个男孩的舞蹈技能值。

类似地，第三行包含一个整数 $m$（$1 \leq m \leq 100$）—— 女孩的数量。
第四行包含序列 $b_1, b_2, \dots, b_m$（$1 \leq b_j \leq 100$），其中 $b_j$ 表示第 $j$ 个女孩的舞蹈技能值。

Print a single number — the required maximum possible number of pairs.

输出一个整数——即所要求的最大可能的配对数量。