#include <bits/stdc++.h>
//#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;

//-----------------------------------------------------------------------------

int A,a[10],B,b[10];


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

	cin>>A;
	REP(i,A) cin>>a[i];
	sort(a,a+A,greater<int>());
	cin>>B;
	REP(i,B) cin>>b[i];
	sort(b,b+B,greater<int>());
	int cnt=1,last=a[0],turn=1,i=0,j=0;
	while(true) {
		if(i==A||j==B) break;
		if(turn==0) {
			turn=1;
			while(last<=a[i]&&i<A) i++;
			if(i==A) break;
			last=a[i],cnt++;
		}
		else {
			turn=0;
			while(last<=b[j]&&j<B) j++;
			if(j==B) break;
			last=b[j],cnt++;
		}
	}
	int ans=cnt;
	cnt=1,last=b[0],turn=0,i=0,j=0;
		while(true) {
		if(i==A||j==B) break;
		if(turn==0) {
			turn=1;
			while(last<=a[i]&&i<A) i++;
			if(i==A) break;
			last=a[i],cnt++;
		}
		else {
			turn=0;
			while(last<=b[j]&&j<B) j++;
			if(j==B) break;
			last=b[j],cnt++;
		}
	}
	cout<<max(ans,cnt)<<endl;

	return 0;
}