#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int Nw, Nb;
int W[10], B[10];
vector<int> es[20];
bool ved[20];

int len(int v) {
	if (ved[v]) return 0;
	int res = 1;
	REP(i, es[v].size()) res = max(res, 1 + len(es[v][i]));
	return res;
}

int main(int argc, char **argv) {
	cin >> Nw;
	REP(i, Nw) cin >> W[i];
	cin >> Nb;
	REP(i, Nb) cin >> B[i];
	REP(i, Nw) REP(j, Nb) {
		if (W[i] < B[j]) es[i].push_back(Nw + j);
		if (W[i] > B[j]) es[Nw + j].push_back(i);
	}
	CLEAR(ved);
	int res = 0;
	REP(i, Nw + Nb) res = max(res, len(i));
	cout << res << endl;
	return 0;
}