import java.util.Arrays;
import java.util.Scanner;


public class Main_yukicoder110 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int nw = sc.nextInt();
        int[] w = new int[nw];
        for (int i = 0; i < nw; i++) {
        	w[i] = sc.nextInt();
        }
        Arrays.sort(w);

        int nb = sc.nextInt();
        int[] b = new int[nb];
        for (int i = 0; i < nb; i++) {
        	b[i] = sc.nextInt();
        }
        Arrays.sort(b);

        int prev = Integer.MAX_VALUE;
        int iw = nw - 1;
        int ib = nb - 1;
        int i;
        for (i = 0; iw >= 0 && ib >= 0; i++) {
        	if (i % 2 == 0) {
        		while (iw >= 0 && w[iw] >= prev) {
        			iw--;
        		}
        		if (iw >= 0) {
        			prev = w[iw];
        		}
        	} else {
        		while (ib >= 0 && b[ib] >= prev) {
        			ib--;
        		}
        		if (ib >= 0) {
        			prev = b[ib];
        		}
        	}

        }

        int ret = i;
        prev = Integer.MAX_VALUE;
        iw = nw - 1;
        ib = nb - 1;
        for (i = 0; iw >= 0 && ib >= 0; i++) {
        	if (i % 2 == 1) {
        		while (iw >= 0 && w[iw] >= prev) {
        			iw--;
        		}
        		if (iw >= 0) {
        			prev = w[iw];
        		}
        	} else {
        		while (ib >= 0 && b[ib] >= prev) {
        			ib--;
        		}
        		if (ib >= 0) {
        			prev = b[ib];
        		}
        	}
        }

        System.out.println(Math.max(ret, i) - 1);

        sc.close();
    }
}