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

int solve(int nw, int w[11], int nb, int b[11])
{
	int i, j = 1, count = 1, k = 1, l = 1;

	while (1)
	{
		for (i = k; i <= nb; i++)
		{
			if (w[j] > b[i])
			{
				k = i + 1;
				count++;
				break;
			}
		}

		for (j = l; j <= nw; j++)
		{
			if (b[i] > w[j])
			{
				l = j + 1;
				count++;
				break;
			}
		}

		if (i >= nb && j >= nw) break;
	}

	return count;
}

int main()
{
	int nw, w[11], nb, b[11];

	cin >> nw;

	for (int i = 1; i <= nw; i++)
	{
		cin >> w[i];
	}

	sort(w + 1, w + nw + 1, greater<int>());

	cin >> nb;

	for (int i = 1; i <= nb; i++)
	{
		cin >> b[i];
	}

	sort(b + 1, b + nb + 1, greater<int>());

	cout << max(solve(nw, w, nb, b), solve(nb, b, nw, w)) << endl;
}