#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll inf=144499999999994;
ll mod=1000000007;
int main(){
    ll n,m;
    cin >> n;
    vector<ll>w(n);
    for (ll i = 0; i < n; i++)
    {
        cin >> w[i];
    }
    cin >> m;
    vector<ll>b(m);
    for (ll i = 0; i < m; i++)
    {
        cin >> b[i];
    }
    sort(w.begin(),w.end());
    reverse(w.begin(),w.end());
    sort(b.begin(),b.end());
    reverse(b.begin(),b.end());
    ll now=w[0];
    ll ans=1;
    ll z=0;
    while (1)
    {
        if (z%2==0)
        {
            bool ok=false;
            for (ll i = 0; i < b.size(); i++)
            {
                if (b[i]<now)
                {
                    now=b[i];
                    ok=true;
                    ans+=1;
                    z+=1;
                    z%=2;
                    break;
                }
            }
            if (!ok)
            {
                break;
            }
        }else{
            bool ok=false;
            for (ll i = 0; i < w.size(); i++)
            {
                if (w[i]<now)
                {
                    now=w[i];
                    ok=true;
                    ans+=1;
                    z+=1;
                    z%=2;
                    break;
                }
            }
            if (!ok)
            {
                break;
            }
        }
    }
    now=b[0];
    ll x=1;
    z=0;
    while (1)
    {
        if (z%2)
        {
            bool ok=false;
            for (ll i = 0; i < b.size(); i++)
            {
                if (b[i]<now)
                {
                    now=b[i];
                    ok=true;
                    x+=1;
                    z+=1;
                    z%=2;
                    break;
                }
            }
            if (!ok)
            {
                break;
            }
        }else{
            bool ok=false;
            for (ll i = 0; i < w.size(); i++)
            {
                if (w[i]<now)
                {
                    now=w[i];
                    ok=true;
                    x+=1;
                    z+=1;
                    z%=2;
                    break;
                }
            }
            if (!ok)
            {
                break;
            }
        }
    }
    cout << max(ans,x) << endl;
}