#include "bits/stdc++.h"

using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
	REP(i, v.size()) { if (i)os << " "; os << v[i]; }return os;
}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v) {
	REP(i, v.size()) { if (i)os << endl; os << v[i]; }return os;
}

const ll INF = LLONG_MAX;
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

#define int long long

inline void my_io() {

	std::ios::sync_with_stdio(false);

	std::cin.tie(0);

	cout << fixed << setprecision(16);

	//cout << setprecision(10) << scientific << ans << endl;
}

signed main() {
	ll nw, nb;

	cin >> nw;

	vector<ll> w(nw);

	REP(i, nw) {
		cin >> w[i];
	}

	cin >> nb;

	vector<ll> b(nb);

	REP(i, nb) {
		cin >> b[i];
	}

	sort(w.begin(), w.end(), greater<ll>());
	sort(b.begin(), b.end(), greater<ll>());

	ll ans1 = 0;
	ll prev = INF;
	ll index = 0;

	REP(i, nw) {
		while (i < nw && w[i] >= prev) {
			i++;
		}

		if (i < nw) {
			ans1++;
			prev = w[i];
		}
		else {
			break;
		}

		while (index < nb && b[index] >= prev) {
			index++;
		}

		if (index < nb) {
			ans1++;
			prev = b[index];
			index++;
		}
		else {
			break;
		}
	}
	
	ll ans2 = 0;
	prev = INF;
	index = 0;

	REP(i, nb) {
		while (i < nb && b[i] >= prev) {
			i++;
		}

		if (i < nb) {
			ans2++;
			prev = b[i];
		}
		else {
			break;
		}

		while (index < nw && w[index] >= prev) {
			index++;
		}

		if (index < nw) {
			ans2++;
			prev = w[index];
			index++;
		}
		else {
			break;
		}
	}

	cout << max(ans1, ans2) << endl;
}