import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner koko = new Scanner(System.in);
        int nw = koko.nextInt();
        int[] ww = new int[nw];
        for(int i=0; i<nw; i++){
            ww[i] = koko.nextInt();
        }
        int nb = koko.nextInt();
        int[] wb = new int[nb];
        for(int i=0; i<nb; i++){
            wb[i] = koko.nextInt();
        }
        Arrays.sort(ww);
        int[] w = new int[nw];
        for(int i=0; i<nw; i++){
            w[i]=ww[nw-1-i];
        }
        Arrays.sort(wb);
        int[] b = new int[nb];
        for(int i=0; i<nb; i++){
            b[i]=wb[nb-1-i];
        }
        char color = 'N';
        int count=0;
        int countb=0;
        int countw=0;
        int now=0;
        if(w[0]>b[0]){
            count=1;
            countw=0;
            now=w[0];
            color='W';
            while(countb!=nb-1||countw!=nw-1){
                if(color=='W'){
                    if(b[nb-1]>=now){
                        break;
                    }
                    for(int i=countb; i<nb; i++){
                        if(b[i]<now){
                            count=count+1;
                            countb=i+1;
                            now=b[i];
                            color='B';
                            break;
                        }
                    }
                }else if(color=='B'){
                    if(w[nw-1]>=now){
                        break;
                    }
                    for(int i=countw; i<nw; i++){
                        if(w[i]<now){
                            count=count+1;
                            countw=i+1;
                            now=w[i];
                            color='W';
                            break;
                        }
                    }
                }
            }
        }else if(w[0]<b[0]){
            count=1;
            countb=0;
            now=b[0];
            color='B';
            while(countb!=nb||countw!=nw){
                if(color=='W'){
                    if(b[nb-1]>=now){
                        break;
                    }
                    for(int i=countb; i<nb; i++){
                        if(b[i]<now){
                            count=count+1;
                            countb=i+1;
                            now=b[i];
                            color='B';
                            break;
                        }
                    }
                }else if(color=='B'){
                    if(w[nw-1]>=now){
                        break;
                    }
                    for(int i=countw; i<nw; i++){
                        if(w[i]<now){
                            count=count+1;
                            countw=i+1;
                            now=w[i];
                            color='W';
                            break;
                        }
                    }
                }
            }
        }else if(w[0]==b[0]){
            count=1;
            now=w[0];
            if(nb>2&&nw>2){
                for(int i=1; i<Math.min(nb,nw); i++){
                    if(w[i]==b[i]){
                        if(w[i]<now){
                            count=count+1;
                            now=w[i];
                            countb=i+1;
                            countw=i+1;
                            color='W';
                        }
                    }else if(w[i]>b[i]){
                        if(w[i]<now){
                            count=count+1;
                            now=w[i];
                            countw=i+1;
                            countb=i;
                            color='W';
                            break;
                        }else if(b[i]<now){
                            count=count+1;
                            now=b[i];
                            countw=i+1;
                            countb=i+1;
                            color='B';
                            break;
                        }
                    }else if(w[i]<b[i]){
                        if(b[i]<now){
                            count=count+1;
                            now=b[i];
                            countb=i+1;
                            countw=i;
                            color='B';
                            break;
                        }else if(w[i]<now){
                            count=count+1;
                            now=w[i];
                            countw=i+1;
                            countb=i+1;
                            color='W';
                            break;
                        }
                    }else if(i==Math.min(nb,nw)-1){
                        if(nb>nw){
                            now=w[i];
                            countw=nw;
                            countb=nw-1;
                            color='W';
                        }else if(nw>nb){
                            now=b[i];
                            countw=nb-1;
                            countb=nb;
                            color='B';
                        }else if(nw==nb){
                            countw=nw;
                            countb=nb;
                        }
                    }
                }
            }else if(nb==1){
                count=1;
                countb=nb-1;
                now=b[0];
                countw=0;
                color='B';
            }else if(nw==1){
                count=1;
                countb=0;
                countw=nw-1;
                now=w[0];
                color='W';
            }
            while(countb!=nb||countw!=nw){
                if(color=='W'){
                    if(b[nb-1]>=now){
                        break;
                    }
                    for(int i=countb; i<nb; i++){
                        if(b[i]<now){
                            count=count+1;
                            countb=i+1;
                            now=b[i];
                            color='B';
                            break;
                        }
                    }
                }else if(color=='B'){
                    if(w[nw-1]>=now){
                        break;
                    }
                    for(int i=countw; i<nw; i++){
                        if(w[i]<now){
                            count=count+1;
                            countw=i+1;
                            now=w[i];
                            color='W';
                            break;
                        }
                    }
                }
            }
        }
        System.out.println(count);
    }
}