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

int solve(priority_queue<int> now, priority_queue<int> nxt) {
    int ret = 0, len = 1000;
    while (true) {
        while (!now.empty() && now.top() >= len) {
            now.pop();
        }
        if (now.empty())
            break;
        ret++;
        len = now.top();
        now.pop();
        swap(now, nxt);
    }
    return ret;
}

int main() {
    int Nw, Nb;
    priority_queue<int> B, W;
    cin >> Nw;
    for (int i = 0; i < Nw; i++) {
        int a;
        cin >> a;
        W.push(a);
    }
    cin >> Nb;
    for (int i = 0; i < Nb; i++) {
        int a;
        cin >> a;
        B.push(a);
    }

    cout << max(solve(B, W), solve(W, B));
}