#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

int solve(VI a, VI b){
    int p = 0 , q = 0 ;
    int w = 1<<28;
    int ans = 0 ;
    while(true){
        while(p < SZ(a) && a[p] >= w){
            p++;
        }
        if(p == SZ(a)) break;
        ans++;
        w = a[p];
        while(q < SZ(b) && b[q] >= w){
            q++;
        }
        if(q == SZ(b)) break;
        ans++;
        w = b[q];
    }
    return ans;
}

int main()
{
    int NW;
    cin>>NW;
    VI W(NW);
    FOR(i,NW) cin>>W[i];
    int NB;
    cin>>NB;
    VI B(NB);
    FOR(i,NB) cin>>B[i];
    sort(ALL(W)); reverse(ALL(W));
    sort(ALL(B)); reverse(ALL(B));
    cout<<max(solve(W,B),solve(B,W))<<endl;
    return 0;
}