import java.util.Scanner;
import java.util.TreeSet;
public class Main {
 
    public static void main(String[] args) {
        Scanner sc =new Scanner(System.in);
        TreeSet<Integer> st = new TreeSet<>();
        int n=sc.nextInt();
        for(int i=0;i<n;i++){
            int b=sc.nextInt();
            st.add(b);
        }
        int q=sc.nextInt();
        int ans=0;
        for(int i=0;i<q;i++){
        int c=sc.nextInt();
        if(st.contains(c)) ans++; 
        }
        System.out.println(ans);
        sc.close();
      
    }
}


/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