#include <iostream>
#include <algorithm>
using namespace std;

int main(){
	int W, B;
	cin >> W;
	int w[W];
	for(int i = 0; i < W; i++) cin >> w[i];
	cin >> B;
	int b[B];
	for(int i = 0; i < B; i++) cin >> b[i];
	sort(w, w + W);
	reverse(w, w + W);
	sort(b, b + B);
	reverse(b, b + B);
	int white = 0, black = 0;
	bool used_white[W]{}, used_black[B]{};
	for(int i = 0, puni = 1e9; i < W; i++){
		if(puni <= w[i]) continue;
		white++;
		bool f = true;
		for(int j = 0; j < B; j++) if(b[j] < w[i] && !used_black[j]){
			white++;
			f = false;
			used_black[j] = true;
			puni = b[j];
			break;
		}
		if(f) break;
	}
	for(int i = 0, puni = 1e9; i < B; i++){
		if(puni <= b[i]) continue;
		black++;
		bool f = true;
		for(int j = 0; j < W; j++) if(w[j] < b[i] && !used_white[j]){
			black++;
			f = false;
			used_white[j] = true;
			puni = w[j];
			break;
		}
		if(f) break;
	}
	cout << max(white, black) << endl;
}