#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N[2];
	while(~scanf("%d", &N[0])) {
		vector<int> X[2];
		X[0].resize(N[0]);
		for(int i = 0; i < N[0]; ++ i)
			scanf("%d", &X[0][i]);
		scanf("%d", &N[1]);
		X[1].resize(N[1]);
		for(int i = 0; i < N[1]; ++ i)
			scanf("%d", &X[1][i]);
		rep(k, 2)
			sort(all(X[k]));
		int ans = 0;
		rep(k, 2) {
			int n[2] = { 0, 0 };
			int p = k, l = -1, x = 0;
			while(1) {
				while(n[p] < N[p] && l >= X[p][n[p]])
					++ n[p];
				if(n[p] == N[p]) {
					break;
				} else {
					l = X[p][n[p] ++];
					++ x;
				}
				p ^= 1;
			}
			amax(ans, x);
		}
		printf("%d\n", ans);
	}
	return 0;
}