#include <iostream>
#include <algorithm>
using namespace std;

int func(const vector<int>& a, const vector<int>& b)
{
    int n=a.size(), m=b.size();
    int f=0, ai=0, bi=0;
    int res=1, len=a[ai];
    while (true) {
        if (f) {
            while (ai<n and a[ai]>=b[bi]) ++ai;
            if (ai==n) break;
            ++res;
        }
        else {
            while (bi<m and b[bi]>=a[ai]) ++bi;
            if (bi==m) break;
            ++res;
        }
        f^=1;
    }
    return res;
}

int main()
{
    int n; cin>>n;
    vector<int> w(n);
    for(int& v: w) cin>>v;
    sort(begin(w), end(w));
    reverse(begin(w), end(w));

    int m; cin>>m;
    vector<int> b(m);
    for(int& v: b) cin>>v;
    sort(begin(b), end(b));
    reverse(begin(b), end(b));

    cout<<max(func(w, b), func(b, w))<<endl;
}