#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };

using LL = long long int;
using LD = long double;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; }

int func(int i, vi a, int j, vi b) {
	int cnt = 0;
	int mi = INF;

	for (;;) {
		while (i >= 0 && mi <= a[i]) {
			i--;
		}
		if (i < 0) {
			return cnt;
		}

		mi = a[i];
		i--;
		cnt++;

		while (j >= 0 && mi <= b[j]) {
			j--;
		}
		if (j < 0) {
			return cnt;
		}

		mi = b[j];
		j--;
		cnt++;
	}
}

int solve(int na, vi w, int nb, vi b) {
	SORT(w);
	SORT(b);

	return max(func(na-1, w, nb-1, b), func(nb-1, b, na-1, w));
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int na; cin >> na;
	vi w(na);
	REP(i, na) cin >> w[i];

	int nb; cin >> nb;
	vi b(nb);
	REP(i, nb) cin >> b[i];

	cout << solve(na, w, nb, b) << endl;
	return 0;
}