codeforces 489B

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.

Input

The first line contains an integer n (1 ≤ n ≤ 100) — the number of boys. The second line contains sequence a₁, a₂, ..., 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₁, b₂, ..., b_m(1 ≤ b_j ≤ 100), where b_j is the j-th girl's dancing skill.

Output

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

Sample Input

Input

4
1 4 6 2
5
5 1 5 7 9

Output

3

Input

4
1 2 3 4
4
10 11 12 13

Output

0

Input

5
1 1 1 1 1
3
1 2 3

Output

2

dp[i][j]：前i个男孩和前j个女孩能组的最多队.

设男孩为a,女孩为b

if(a[i]==b[j]+1||a[i]==b[j]||a[i]==b[j]-1) dp[i][j]=dp[i-1][j-1]+1;

else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
#ifdef glx
	freopen("in.txt","r",stdin);
#endif
	int n,m,a[150],b[150];
	int dp[150][150];
	while(cin>>n)
	{
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
		}
		cin>>m;
		for(int j=1;j<=m;j++)
			scanf("%d",&b[j]);
		sort(a+1,a+n+1);
		sort(b+1,b+m+1);
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				if(a[i]==b[j]||a[i]==b[j]+1||a[i]==b[j]-1)
					dp[i][j]=dp[i-1][j-1]+1;
				else
					dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
			}
		}
		cout<<dp[n][m]<<endl;
	}
	return 0;
}