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

using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class t> using vc = vector<t>;
template<class t> using vvc = vc<vc<t>>;
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vc<int>;
using vvi = vvc<int>;
using vl = vc<ll>;
using vvl = vvc<ll>;

#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define irep(i,a,b) for (int i = (a); i > (b); i--)
#define all(a) a.begin(),a.end()
#define print(n) cout << n << '\n'
#define pritn(n) print(n)
#define printv(n,a) {copy(all(n),ostream_iterator<a>(cout," ")); cout<<"\n";}
#define printvv(n,a) {for(auto itr:n) printv(itr,a);}
#define rup(a,b) (a+b-1)/b
#define input(A,N) rep(i,0,N) cin>>A[i]
#define chmax(a,b) a = max(a,b)
#define chmin(a,b) a = min(a,b)

int solve(vi& a,vi& b){
    int ans = 1;
    int ni = 1,nj = 0;
    int now = a[0];
    int nn = 0;
    while(true){
        if(nn==0){
            if(nj==b.size()) break;
            while(b[nj]>=now){
                nj++;
                if(nj==b.size())break;
            }
            if(nj==b.size()) break;
            now = b[nj];
            ans++;
            nn = 1;
            nj++;
            continue;
        }else{
            if(ni==a.size()) break;
            while(a[ni]>=now){
                ni++;
                if(ni==a.size())break;
            }
            if(ni==a.size()) break;
            now = a[ni];
            ans++;
            nn = 0;
            ni++;
        }
    }
    return ans;
}


int main(){
    cout << fixed << setprecision(15);
    
    int n,m;
    cin>>n;
    vi a(n);
    input(a,n);
    cin>>m;
    vi b(m);
    input(b,m);
    sort(all(a),greater<int>());
    sort(all(b),greater<int>());
    int ans = solve(a,b);
    print(max(ans,solve(b,a)));
    //system("pause");
    return 0;
}