#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;
using ll = long long;

int W[12];
int B[12];

int Nw, Nb;

int solve(int color, int lastHeight) {
    switch (color) {
    case 1:
        for (int i = 0; i < Nb; i++) {
            if (B[i] < lastHeight) {
                return 1 + solve(-1, B[i]);
            }
        }
        break;
    case -1:
        for (int i = 0; i < Nw; i++) {
            if (W[i] < lastHeight) {
                return 1 + solve(1, W[i]);
            }
        }
        break;
    }
    return 0;
}

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

    cin >> Nw;
    for (int i = 0; i < Nw; i++) {
        cin >> W[i];
    }
    cin >> Nb;
    for (int i = 0; i < Nb; i++) {
        cin >> B[i];
    }

    sort(W, W + Nw, greater<int>());
    sort(B, B + Nb, greater<int>());

    cout << 1 + max(solve(1, W[0]), solve(-1, B[0])) << endl;

    return 0;
}