#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MOD = 1000000007;

int NW,NB;
int W[11],B[11];

int getw(int l){
    int i = 0;
    while(i < NW){
        if(W[i] < l) return W[i];
        i++;
    }
    return 0;
}
int getb(int l){
    int i = 0;
    while(i < NB){
        if(B[i] < l) return B[i];
        i++;
    }
    return 0;
}


int main(){
    cin >> NW;
    REP(i,NW){
        cin >> W[i];
    }
    cin >> NB;
    REP(i,NB){
        cin >> B[i];
    }
    sort(W,W+NW,greater<int>());
    sort(B,B+NB,greater<int>());

    int maxv = 0, c = 0, l = 1<<29;
    while(1){
        l = getw(l);
        if(l == 0) break;
        c++;
        l = getb(l);
        if(l == 0) break;
        c++;
    }
    maxv = max(maxv, c);
    l = 1<<29, c = 0;
    while(1){
        l = getb(l);
        if(l == 0) break;
        c++;
        l = getw(l);
        if(l == 0) break;
        c++;
    }
    maxv = max(maxv, c);
    cout << maxv << endl;

    return 0;
}