import java.util.*;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int[] l1 = new int[n];
		for (int i = 0; i < n; i++) {
			l1[i] = sc.nextInt();
		}
		Arrays.sort(l1);
		
		int q = sc.nextInt();
		int[] l2 = new int[q];
		for (int i = 0; i < q; i++) {
			l2[i] = sc.nextInt();
		}
		Arrays.sort(l2);
		
		int count = 0;
		
		for (int i = 0, j = 0; i<n && j<q; i++) {
			if (l1[i] == l2[j]) {
				count++;
				j++;
			}else if (l1[i]>l2[j]) {
				i--;
				j++;
			}
		}
		
		System.out.println(count);
		
		
		
	}
} import java.util.*; util.* java class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int[] l1 = new int[n];
		for (int i = 0; i < n; i++) {
			l1[i] = sc.nextInt();
		}
		Arrays.sort(l1);
		
		int q = sc.nextInt();
		int[] l2 = new int[q];
		for (int i = 0; i < q; i++) {
			l2[i] = sc.nextInt();
		}
		Arrays.sort(l2);
		
		int count = 0;
		
		for (int i = 0, j = 0; i<n && j<q; i++) {
			if (l1[i] == l2[j]) {
				count++;
				j++;
			}else if (l1[i]>l2[j]) {
				i--;
				j++;
			}
		}
		
		System.out.println(count);
		
		
		
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int[] l1 = new int[n];
		for (int i = 0; i < n; i++) {
			l1[i] = sc.nextInt();
		}
		Arrays.sort(l1);
		
		int q = sc.nextInt();
		int[] l2 = new int[q];
		for (int i = 0; i < q; i++) {
			l2[i] = sc.nextInt();
		}
		Arrays.sort(l2);
		
		int count = 0;
		
		for (int i = 0, j = 0; i<n && j<q; i++) {
			if (l1[i] == l2[j]) {
				count++;
				j++;
			}else if (l1[i]>l2[j]) {
				i--;
				j++;
			}
		}
		
		System.out.println(count);
		
		
		
	} main {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int[] l1 = new int[n];
		for (int i = 0; i < n; i++) {
			l1[i] = sc.nextInt();
		}
		Arrays.sort(l1);
		
		int q = sc.nextInt();
		int[] l2 = new int[q];
		for (int i = 0; i < q; i++) {
			l2[i] = sc.nextInt();
		}
		Arrays.sort(l2);
		
		int count = 0;
		
		for (int i = 0, j = 0; i<n && j<q; i++) {
			if (l1[i] == l2[j]) {
				count++;
				j++;
			}else if (l1[i]>l2[j]) {
				i--;
				j++;
			}
		}
		
		System.out.println(count);
		
		
		
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] l1 = new int[n]; l1 new int[n] n for (int i = 0; i < n; i++) {
			l1[i] = sc.nextInt();
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			l1[i] = sc.nextInt();
		} {
			l1[i] = sc.nextInt();
		} l1[i] = sc.nextInt() l1[i] l1 i sc.nextInt() sc.nextInt sc Arrays.sort(l1) Arrays.sort Arrays l1 int q = sc.nextInt(); q sc.nextInt() sc.nextInt sc int[] l2 = new int[q]; l2 new int[q] q for (int i = 0; i < q; i++) {
			l2[i] = sc.nextInt();
		} int i = 0; int i = 0; i 0 i < q i q i++ i++ i {
			l2[i] = sc.nextInt();
		} {
			l2[i] = sc.nextInt();
		} l2[i] = sc.nextInt() l2[i] l2 i sc.nextInt() sc.nextInt sc Arrays.sort(l2) Arrays.sort Arrays l2 int count = 0; count 0 for (int i = 0, j = 0; i<n && j<q; i++) {
			if (l1[i] == l2[j]) {
				count++;
				j++;
			}else if (l1[i]>l2[j]) {
				i--;
				j++;
			}
		} int i = 0, j = 0; int i = 0 i 0 j = 0; j 0 i<n && j<q i<n i n j<q j q i++ i++ i {
			if (l1[i] == l2[j]) {
				count++;
				j++;
			}else if (l1[i]>l2[j]) {
				i--;
				j++;
			}
		} {
			if (l1[i] == l2[j]) {
				count++;
				j++;
			}else if (l1[i]>l2[j]) {
				i--;
				j++;
			}
		} if (l1[i] == l2[j]) {
				count++;
				j++;
			}else if (l1[i]>l2[j]) {
				i--;
				j++;
			} l1[i] == l2[j] l1[i] l1 i l2[j] l2 j {
				count++;
				j++;
			} count++ count j++ j if (l1[i]>l2[j]) {
				i--;
				j++;
			} l1[i]>l2[j] l1[i] l1 i l2[j] l2 j {
				i--;
				j++;
			} i-- i j++ j System.out.println(count) System.out.println System.out System System.out count String[] args args
import java.util.*;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int[] l1 = new int[n];
		for (int i = 0; i < n; i++) {
			l1[i] = sc.nextInt();
		}
		Arrays.sort(l1);
		
		int q = sc.nextInt();
		int[] l2 = new int[q];
		for (int i = 0; i < q; i++) {
			l2[i] = sc.nextInt();
		}
		Arrays.sort(l2);
		
		int count = 0;
		
		for (int i = 0, j = 0; i<n && j<q; i++) {
			if (l1[i] == l2[j]) {
				count++;
				j++;
			}else if (l1[i]>l2[j]) {
				i--;
				j++;
			}
		}
		
		System.out.println(count);
		
		
		
	}
}
