import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        int wn = sc.nextInt();
        int[] wArr = new int[wn];
        for (int i = 0; i < wn; i++) {
            wArr[i] = sc.nextInt();
        }
        Arrays.sort(wArr);
        int bn = sc.nextInt();
        int[] bArr = new int[bn];
        for (int i = 0; i < bn; i++) {
            bArr[i] = sc.nextInt();
        }
        Arrays.sort(bArr);
        int wIdx = wn - 1;
        int bIdx = bn - 1;
        int wCount = 0;
        int wPrev = Integer.MAX_VALUE;
        while (true) {
            while (wIdx >= 0 && wPrev <= wArr[wIdx]) {
                wIdx--;
            }
            if (wIdx < 0) {
                break;
            }
            wCount++;
            wPrev = wArr[wIdx]; 
            while (bIdx >= 0 && wPrev <= bArr[bIdx]) {
                bIdx--;
            }
            if (bIdx < 0) {
                break;
            }
            wCount++;
            wPrev = bArr[bIdx]; 
        }
        wIdx = wn - 1;
        bIdx = bn - 1;
        int bCount = 0;
        int bPrev = Integer.MAX_VALUE;
        while (true) {
            while (bIdx >= 0 && bPrev <= bArr[bIdx]) {
                bIdx--;
            }
            if (bIdx < 0) {
                break;
            }
            bCount++;
            bPrev = bArr[bIdx];
            while (wIdx >= 0 && bPrev <= wArr[wIdx]) {
                wIdx--;
            }
            if (wIdx < 0) {
                break;
            }
            bCount++;
            bPrev = wArr[wIdx];
        }
        System.out.println(Math.max(wCount, bCount));
    }
}