#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(int (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(int (i)=(a)-1;(i)>=(b);(i)--)
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define VI vector<int>
#define VII vector<VI>
#define VL vector<LL>
#define VLL vector<VL>
#define VD vector<double>
#define VDD vector<VD>
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<LL,LL>
#define VPII vector<PII>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define FORE(a,b) for(auto &&a:b)
#define FIND(s,n) s.find(n)!=s.end()

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF=1e9;
const int MOD=INF+7;

int calc(VII WB,int n){
    int res = 0;
    int be = INF;
    while(1){
        bool f = false;
        REP(i,WB[n].size()){
            if(be>WB[n][i]){
                be = WB[n][i];
                res++;
                WB[n].erase(WB[n].begin()+i);
                f = true;
                break;
            }
        }
        n = (n+1)%2;
        if(!f) break;
    }
    return res;
}

int main(void){
    VII WB(2);
    int Nw; cin >> Nw;
    WB[0] = VI(Nw);
    REP(i,Nw) cin >> WB[0][i];
    SORT(WB[0]); REVERSE(WB[0]);
    int Nb; cin >> Nb;
    WB[1] = VI(Nb);
    REP(i,Nb) cin >> WB[1][i];
    SORT(WB[1]); REVERSE(WB[1]);
    int ans = 0;
    REP(i,2){
        ans = max(ans,calc(WB,i));
        //DEBUG(calc(WB,i));
    }
    cout << ans << endl;
}