#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    int a[n];
    rep(i,n)cin >> a[i];
    int m;
    cin >> m;
    int b[m];
    rep(i,m)cin >> b[i];
    sort(a,a+n);
    sort(b,b+m);
    int x = n - 1;
    int y = m - 1;
    int tmp1 = 0;
    int now = 1001001001;
    while(true){
        if(tmp1 % 2 == 0){
            if(x < 0)break;
            while(0 <= x){
                if(a[x] < now){
                    tmp1++;
                    now = a[x];
                    x--;
                    break;
                }
                x--;
            }
            
        }else{
            if(y < 0)break;
            while(0 <= y){
                if(b[y] < now){
                    tmp1++;
                    now = b[y];
                    y--;
                    break;
                }
                y--;
            }
            
        }
    }
    int ans = tmp1;
    tmp1 = 0;
    x = n - 1;
    y = m - 1;
    now = 1001001001;
    while(true){
        if(tmp1 % 2 == 1){
            if(x < 0)break;
            while(0 <= x){
                if(a[x] < now){
                    tmp1++;
                    now = a[x];
                    x--;
                    break;
                }
                x--;
            }
            
        }else{
            if(y < 0)break;
            while(0 <= y){
                if(b[y] < now){
                    tmp1++;
                    now = b[y];
                    y--;
                    break;
                }
                y--;
            }
            
        }
    }
    cout << max(ans, tmp1) << endl;    
    return 0;
}