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

using namespace std;

int main() {
	int n;
	vector<int> c[2];
	cin >> n;
	c[0].resize(n);
	for (int i = 0; i < n; ++i) {
		cin >> c[0][i];
	}
	cin >> n;
	c[1].resize(n);
	for (int i = 0; i < n; ++i) {
		cin >> c[1][i];
	}
	sort(c[0].begin(), c[0].end());
	sort(c[1].begin(), c[1].end());
	int maxHeight = 0;
	for (int startColor = 0; startColor <= 1; ++startColor) {
		int color = startColor;
		int next[2] = { c[0].size() - 1, c[1].size() - 1 };
		int length = numeric_limits<int>::max();
		int height = 0;
		for (;;) {
			while (next[color] >= 0 && c[color][next[color]] >= length) {
				--next[color];
			}
			if (next[color] < 0) {
				break;
			}
			length = c[color][next[color]];
			--next[color];
			++height;
			color = 1 - color;
		}
		maxHeight = max(maxHeight, height);
	}
	cout << maxHeight << endl;
	return 0;
}