#include <iostream>
#include <algorithm>
#include <vector>

int max_height(int *p , int *q , int Np , int Nq)
{
	int h = 1;
	bool flag = true;
	int ip = 0, iq = 0;
	while(flag)
	{
		flag = false;
		for(int i=iq;i<Nq;i++)
		{
			if(q[i]<p[ip])
			{
				h++;
				iq = i;
				ip++;
				std::swap(p,q);
				std::swap(ip,iq);
				std::swap(Np,Nq);
				flag = true;
				break;
			}
		}
	}
	return h;
}

int main()
{
	int Nw; std::cin >> Nw;
	int *W = new int[Nw];
	for(int n=0;n<Nw;n++)
	{
		std::cin >> W[n];
	}
	int Nb; std::cin >> Nb;
	int *B = new int[Nb];
	for(int n=0;n<Nb;n++)
	{
		std::cin >> B[n];
	}
 	std::sort(W , W+Nw , std::greater<int>());
 	std::sort(B , B+Nb , std::greater<int>());

	int h = std::max(max_height(W,B,Nw,Nb) , max_height(B,W,Nb,Nw));
	std::cout << h;

	delete[] W;
	delete[] B;
	return 0;
}