You are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.

Notes

Constraints

* Elements in S is sorted in ascending order
* n ≤ 100000
* q ≤ 50000
* 0 ≤ an element in S ≤ 109
* 0 ≤ an element in T ≤ 109

Input

In the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.

Output

Print C in a line.

Examples

Input

5
1 2 3 4 5
3
3 4 1


Output

3


Input

3
1 2 3
1
5


Output

0


Input

5
1 1 2 2 3
2
1 2


Output

2
import java.util.Scanner;

public class Main {
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] S = new int[n];
		for (int i = 0; i < n; i++) {
			S[i] = sc.nextInt();
		}
		int m = sc.nextInt();
		int[] T = new int[m];
		for (int j = 0; j < m; j++) {
			T[j] = sc.nextInt();
		}
	System.out.println(binSearch(S, n, T, m));
	}

	static int binSearch(int[] array, int n, int[] array1, int m) {
		int count = 0;
		for (int i = 0; i < m; i++) {
			int key = array1[i];
			int pl = 0;
			int pr = n - 1;
			do {
				int pc = (pr + pl) / 2;
			if (array[pc] == key) {
				count++;
				break;
			} else if (array[pc] < key){
				pl = pc + 1;
			} else {
				pr = pc - 1;
			}
			} while (pl <= pr);
		}
		return count;
	}
}
