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

int main() {
	// your code goes here
	int bn,wn;
	int b[30]={0},w[30]={0};
	cin>>wn;
	for(int i=0;i<wn;i++) cin>>w[i];
	
	cin>>bn;
	for(int i=0;i<bn;i++) cin>>b[i];
	
	sort(w,w+wn);
	sort(b,b+bn);
	
	int bk=bn-1,wk=wn-1;
	int len=100000000,ans1=0,ans2=0;
	while(bk>=0&&wk>=0){
		while(len <= b[bk]) {
			bk=bk-1;
			if(bk<0) break;
		}
		if(bk >= 0){
		len=b[bk];
		//cout<<len<<endl;
		ans1++;
		}
		else break;
			while(len <= w[wk]) {
			wk=wk-1;
			if(wk<0) break;
		}
		if(wk>=0){
		len=w[wk];
		//cout<<len<<endl;
		ans1++;
		}
		
		
	}
	len=100000000;
	bk=bn-1,wk=wn-1;
	while(bk>=0&&wk>=0){
		while(len <= w[wk]) {
			wk=wk-1;
			if(wk<0) break;
		}
		if(wk >= 0){
		len=w[wk];
		
	//	cout<<len<<endl;
		ans2++;
		}
		else break;
			while(len <= b[bk]) {
			bk=bk-1;
			if(bk<0) break;
		}
		if(bk>=0){
		len=b[bk];
	//	cout<<len<<endl;
		ans2++;
		}
		
		
	}
	cout<<max(ans1,ans2)<<endl;
	return 0;
}