#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////


int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//
    
	int Nw,W[10];
	int Nb,B[10];
	cin>>Nw;
	rep(i,Nw)cin>>W[i];
	cin>>Nb;
	rep(i,Nb)cin>>B[i];
	sort(W,W+Nw,greater<int>());
	sort(B,B+Nb,greater<int>());

	int nowW=2000;
	int nowB=2000;
	int H=0,Hmax=0;
	int i;
	
	{
		nowW=2000;
		nowB=2000;
		H=0;
		for(;;)
		{
			for(i=0;i<Nw;++i){
				if(W[i]<nowB){
					nowW = W[i];
					++H;
					break;
				}
			}
			if(i<Nw){
				for(i=0;i<Nb;++i){
					if(B[i]<nowW){
						nowB = B[i];
						++H;
						break;
					}
				}
				if(i<Nb){
	
				}else{
					break;
				}
			}else{
				break;
			}
		}

		if(Hmax<H){
			Hmax = H;
		}
		//////////////////
		nowW=2000;
		nowB=2000;
		H=0;
		for(;;)
		{
			for(i=0;i<Nb;++i){
				if(B[i]<nowW){
					nowB = B[i];
					++H;
					break;
				}
			}
			if(i<Nb){
				for(i=0;i<Nw;++i){
					if(W[i]<nowB){
						nowW = W[i];
						++H;
						break;
					}
				}
				if(i<Nw){
	
				}else{
					break;
				}
			}else{
				break;
			}
		}

		if(Hmax<H){
			Hmax = H;
		}
	}
	P(Hmax);
    return 0;
}