import java.util.Scanner;public class Main {	public static void main(String[] args) {		int n, sum = 0;		Scanner sc = new Scanner(System.in);		n = sc.nextInt();		int[] S = new int[100001];		for (int i = 0; i < n; i++) {			S[i] = sc.nextInt();		}		int q, key = 0;		q = sc.nextInt();		for (int i = 0; i < q; i++) {			key = sc.nextInt();			if (binarySearch(S, n, key))				sum++;		}		System.out.println(sum);	}	private static boolean binarySearch(int[] S, int n, int key) {		int left = 0;		int right = n - 1;		while (left <= right) {			int mid = (left + right) / 2;			if (key == S[mid])				return true;			else if (key > S[mid])				left = mid + 1;			else				right = mid - 1;		}		return false;	}}

/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