#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000


int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	int Nw;
	cin >> Nw;
	int W[20];
	rep(i, Nw) cin >> W[i];
	int Nb;
	cin >> Nb;
	int B[20];
	rep(i, Nb) cin >> B[i];
	sort(W, W + Nw, greater<int>());
	sort(B, B + Nb, greater<int>());
	int w = 0;
	int b = 0;
	int len = W[0];
	int tmp1 = 1;
	while (true) {
		while (b < Nb && len <= B[b]) b++;
		if (b == Nb) break;
		tmp1++;
		len = B[b];
		while (w < Nw && len <= W[w]) w++;
		if (w == Nw) break;
		tmp1++;
		len = W[w];
	}
	w = 0, b = 0;
	len = B[0];
	int tmp2 = 1;
	while (true) {
		while (w < Nw && len <= W[w]) w++;
		if (w == Nw) break;
		tmp2++;
		len = W[w];
		while (b < Nb && len <= B[b]) b++;
		if (b == Nb) break;
		tmp2++;
		len = B[b];
	}
	cout << max(tmp1, tmp2) << endl;

    return 0;
}