import java.util.*;

class Main {
        public static void main(String args[]) {
                try (Scanner sc = new Scanner(System.in)) {
                        int N = sc.nextInt();
                        long[] S = new long[N];
                        for (int i = 0; i < N; i++) {
                                S[i] = sc.nextLong();
                        }
                        int Q = sc.nextInt();
                        long[] T = new long[Q];
                        for (int i = 0; i < Q; i++) {
                                T[i] = sc.nextLong();
                        }
                        Arrays.sort(S);
                        Arrays.sort(T);
                        int ans = 0;
                        for (int i = 0, j = 0; i < N && j < Q; i++) {
                                if (S[i] == T[j]) {
                                        ans++;
                                        j++;
                                } else if(S[i] > T[j]) {
                                        i--;
                                        j++;
                                }
                        }
                        System.out.println(ans);
                }
        }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz