#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1LL << 30;
int MOD = 1e9+7;
int Nw,Nb;
int func(bool flag, vector<int> W, vector<int> B){
    int wi = 0,bi = 0,cnt = 0,num = 0;
    while(wi < Nw && bi < Nb){
        if(flag){
            while(num >= W[wi])wi++;
            num = W[wi];
        }else{
            while(num >= B[bi])bi++;
            num = B[bi];
        }
        cnt++;
        flag = !flag;
    }
    return cnt;
}
main(){
    cin >> Nw;
    vector<int> W(Nw);
    for(int i = 0;i < Nw;i++)cin >> W[i];
    cin >> Nb;
    vector<int> B(Nb);
    for(int i = 0;i < Nb;i++)cin >> B[i];
    sort(W.begin(), W.end());
    sort(B.begin(), B.end());
    cout << max(func(1,W,B), func(0,W,B)) - 1 << endl;
}