import java.util.*;

class Main
{
    public static void main(String args[])
    {
	int n, q, C=0;
	long S[] = new long[100000];
	long k;
	int left, right, mid=0;
	Scanner read = new Scanner(System.in);

	//read
	n=read.nextInt();
	for(int i=0; i<n; i++)S[i]=read.nextInt();

	//search
	q=read.nextInt();
	for(int i=0; i<q; i++)
	    {
		left=0;
		right=n;
		k=read.nextInt();
		while(left<right)
		    {
			mid=(left+right)/2;
			if(S[mid]==k)
			    {
				C++;
				break;
			    }
			else if(S[mid]<k)left=mid+1;
			else right=mid;
		    }
	    }

	//print
	read.close();
	System.out.println(C);


    }
}
/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