#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

void solve() {
    int n;
    cin >> n;
    vi w(n);
    rep(i, n) cin >> w[i];
    int m;
    cin >> m;
    vi b(m);
    rep(i, m) cin >> b[i];
    multiset<int> sw(all(w)), sb(all(b));
    auto f = [&](multiset<int> cur, multiset<int> nxt) {
        int last = 1e9;
        int ans = 0;
        while (cur.size()) {
            auto it = cur.lower_bound(last);
            if (it == cur.begin()) break;
            --it;
            last = *it;
            ans++;
            cur.erase(it);
            swap(cur, nxt);
        }
        return ans;
    };
    int ans = max(f(sb, sw), f(sw, sb));
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}