#include <bits/stdc++.h>
using namespace std;
int main() {
    int n, m;
    cin >> n;
    vector<int> w(n);
    for (int i = 0; i < n; i++) cin >> w[i];
    cin >> m;
    vector<int> b(m);
    for (int i = 0; i < m; i++) cin >> b[i];
    sort(w.begin(), w.end());
    sort(b.begin(), b.end());
    int ans = 0;
    for (int it = 0; it < 2; it++) {
        int a = 0;
        int c = 0;
        bool f = it;
        while (true) {
            int i = (f ? upper_bound(w.begin(), w.end(), a) - w.begin() : upper_bound(b.begin(), b.end(), a) - b.begin());
            if ((f && i == n) || (!f && i == m)) break;
            a = (f ? w[i] : b[i]);
            c++;
            f ^= 1;
        }
        ans = max(ans, c);
    }
    cout << ans << "\n";
}