#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define llong long long

int main() {
    int nw, nb;
    cin >> nw;
    vector<int> ws(nw);
    rep(i, nw) cin >> ws[i];
    cin >> nb;
    vector<int> bs(nb);
    rep(i, nb) cin >> bs[i];

    sort(ws.begin(), ws.end());
    sort(bs.begin(), bs.end());
    int result = 0;
    int current = ws[0];
    int temp = 1;
    while(true) {
        bool flg = true;
        for(int b: bs) {
            if(current < b) {
                current = b;
                temp++;
                flg = false;
                break;
            }
        }
        if(flg) break;
        flg = true;
        for(int w: ws) {
            if(current < w) {
                current = w;
                temp++;
                flg = false;
                break;
            }
        }
        if(flg) break;
    }
    result = max(result, temp);

    temp = 1;
    current = bs[0];
    while(true) {
        bool flg = true;
        for(int w: ws) {
            if(current < w) {
                current = w;
                temp++;
                flg = false;
                break;
            }
        }
        if(flg) break;
        flg = true;
        for(int b: bs) {
            if(current < b) {
                current = b;
                temp++;
                flg = false;
                break;
            }
        }
        if(flg) break;
    }
    result = max(result, temp);

    cout << result << "\n";
}