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

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl

const ll mod = 1e9 + 7;
const ll inf = 1e18;

ll f(vector<ll> &A, vector<ll> &B){
    ll base = inf;
    ll count = 0;
    ll i = 0;
    ll j = 0;
    for(;;){
        if(i==A.size()) return count;
        while(A[i]>=base){
            i++;
            if(i==A.size()) return count;
        }
        base = A[i];
        count++;
        i++;

        if(j==B.size()) return count;
        while(B[j]>=base){
            j++;
            if(j==B.size()) return count;
        }
        base = B[j];
        count++;
        j++;
    }
}

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

    // input
    ll white;
    cin >> white;
    vector<ll> A(white);
    FOR(i, 0, white){
        cin >> A.at(i);
    }
    sort(ALL(A), greater<ll>());

    ll black;
    cin >> black;
    vector<ll> B(black);
    FOR(i, 0, black){
        cin >> B.at(i);
    }
    sort(ALL(B), greater<ll>());

    ll a = f(A, B);
    ll b = f(B, A);

    p(max(a, b));

    return 0;
}