#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;

int func(vector<int> w, vector<int> b){
	int cnt = 0;
	int i=0, j=0;
	int last = 1e9;
	while(1){
		if(cnt%2==0){
			if(i>=w.size()) break;
			if(last > w[i]){
				last = w[i];
				cnt++;
			}
			i++;
		}else{
			if(j>=b.size()) break;
			if(last > b[j]){
				last = b[j];
				cnt++;
			}
			j++;
		}
	}
	
	return cnt;
}

int main(){
	int N;
	cin >> N;
	vector<int> w(N);
	for(int i=0; i<N; i++) cin >> w[i];
	sort(w.begin(), w.end(), greater<int>());
	
	int M;
	cin >> M;
	vector<int> b(M);
	for(int i=0; i<M; i++) cin >> b[i];
	sort(b.begin(), b.end(), greater<int>());

	int ans = max( func(w,b), func(b,w) );
	cout << ans << endl;
	return 0;
}