#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD 1000003
#define INF 100000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;


int main() {
	int	nw, nb;
	int w[16], b[16];
	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 x, y;
	x = y = 0;
	int t = INF;
	bool bo = true;
	while (1) {
		REP(i, nw) {
			if (t > w[i] && bo) {
				t = w[i];
				x++;
				bo = false;
				break;
			}
		}
		if (bo) break;
		REP(i, nb) {
			if (t > b[i] && !bo) {
				t = b[i];
				x++;
				bo = true;
				break;
			}
		}
		if (!bo) break;
	}
	t = INF;
	bo = true;
	while (1) {
		REP(i, nb) {
			if (t > b[i] && bo) {
				t = b[i];
				y++;
				bo = false;
				break;
			}
		}
		if (bo) break;
		REP(i, nw) {
			if (t > w[i] && !bo) {
				t = w[i];
				y++;
				bo = true;
				break;
			}
		}
		if (!bo) break;
	}
	cout << (x >= y ? x : y) << endl;
	return 0;
}