#include <bits/stdc++.h>
#include <atcoder/all>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace atcoder;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vll=vector<ll>;
using vvll=vector<vll>;
using pll=pair<ll,ll>;

// using mint=modint;

// template<class K,class V>
// using ordered_map=tree<K,V,less<K>,rb_tree_tag,tree_order_statistics_node_update>;

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

    ll Nw,Nb;
    cin>>Nw;
    vll W(Nw);
    for(int i=0;i<Nw;++i)cin>>W[i];
    cin>>Nb;
    vll B(Nb);
    for(int i=0;i<Nb;++i)cin>>B[i];
    sort(W.rbegin(),W.rend());
    sort(B.rbegin(),B.rend());

    auto solve=[&](bool white){
        ll wi=0,bi=0;
        ll last=LLONG_MAX;
        ll h=0;
        while(1){
            if(white){
                while(wi<Nw&&W[wi]>=last)wi++;
                if(wi==Nw)break;
                last=W[wi];
                wi++;
                h++;
            }else{
                while(bi<Nb&&B[bi]>=last)bi++;
                if(bi==Nb)break;
                last=B[bi];
                bi++;
                h++;
            }
            white^=1;
        }
        return h;
    };

    cout<<max(solve(1),solve(0))<<endl;

}