#include <iostream>
#include <math.h>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <set>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N;
vector<int> W, B;

int calc(int from) {
    int wi = W.size() - 1;
    int bi = B.size() - 1;
    int size = 100;
    int count = 0;
    while (true) {
        if (from) {
            from--;
        } else {
            while (wi >= 0 && W[wi] >= size) wi--;
            if (wi < 0) break;
            size = W[wi];
            count++;
            wi--;
        }
        while (bi >= 0 && B[bi] >= size) bi--;
        if (bi < 0) break;
        size = B[bi];
        count++;
        bi--;
    }
    return count;
}

signed main()
{
    cin >> N;
    W = vector<int>(N);
    REP(i,N) cin >> W[i];
    cin >> N;
    B = vector<int>(N);
    REP(i,N) cin >> B[i];
    
    sort(ALL(W));
    sort(ALL(B));
    
    int wcount = calc(0);
    int bcount = calc(1);
    
    cout << max(wcount, bcount) << endl;
    
    return 0;
}