#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

int cal(vector<int> a, vector<int> b){
    int cnt=0, pre=100, i=0, j=0;
    while(1){
        while(1){
            if(i>=a.size()) return cnt;
            if(a[i]<pre){
                pre=a[i++];
                cnt++;
                break;
            }
            i++;
        }
        while(1){
            if(j>=b.size()) return cnt;
            if(b[j]<pre){
                pre=b[j++];
                cnt++;
                break;
            }
            j++;
        }
    }

}


int main(){
    int N, M;
    vector<int> W, B;
    cin>> N;
    for(int i=0; i<N; i++){
        int x;
        cin>> x;
        W.push_back(x);
    }
    cin>> M;
    for(int i=0; i<M; i++){
        int x;
        cin>> x;
        B.push_back(x);
    }

    sort(W.begin(), W.end());
    sort(B.begin(), B.end());
    reverse(W.begin(), W.end());
    reverse(B.begin(), B.end());

    cout<< max(cal(W, B), cal(B, W))<< endl;

    return 0;
}