#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

int main() {
	int nw, nb;
	vector<int> white, black;

	cin >> nw;
	white.assign(nw, 0);
	for (int i = 0; i < nw; i++) {
		cin >> white[i];
	}
	cin >> nb;
	black.assign(nb, 0);
	for (int i = 0; i < nb; i++) {
		cin >> black[i];
	}

	sort(white.begin(), white.end(), greater<int>());
	sort(black.begin(), black.end(), greater<int>());


	int now = 1000;
	int step = 0;
	for (int i = 0, j = 0; i < nw; i++) {
		if (white[i] < now) {
			now = white[i];
			step++;

			for (; j < nb; j++) {
				if (black[j] < now) {
					now = black[j];
					step++;
				}
			}
		}
	}
	int ans = step;

	now = 1000;
	step = 0;
	for (int i = 0, j = 0; i < nb; i++) {
		if (black[i] < now) {
			now = black[i];
			step++;

			for (; j < nw; j++) {
				if (white[j] < now) {
					now = white[j];
					step++;
				}
			}
		}
	}
	ans = max(ans, step);

	cout << ans << endl;
	return 0;
}