#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int solve (vector<int> a, vector<int> b ){
	int i = 0, j = 0;
	int curr = -1;
	int cnt = 1;
	vector<int>::iterator it;
	while (i < a.size() && j < b.size() ){
		curr = (cnt % 2 != 0 ? a[i] : b[j] );
		it = (cnt % 2 != 0 ? upper_bound (ALL (b ), curr ) : upper_bound (ALL (a ), curr ) );
		if (cnt % 2 != 0 ){
			if (it == b.end() )
				break;
			else
				j = it - b.begin();
		}else{ // if (cnt % 2 == 0 )
 			if (it == a.end() )
				break;
			else
				i = it - a.begin();
		} // end if
		cnt++;
	} // end while
	
	return cnt;
}		

int main()
{
	ios_base::sync_with_stdio(0);
	int Nw; cin >> Nw;
	vector<int> W(Nw, 0 );
	rep (i, Nw ) cin >> W[i];
	int Nb; cin >> Nb;
	vector<int> B(Nb, 0 );
	rep (i, Nb ) cin >> B[i];

	sort (ALL (W ) );
	sort (ALL (B ) );

	int res = solve (W, B );
	res = max (res, solve (B, W ) );

	cout << res << endl;

	return 0;
}