Problem:
Search II

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.

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.

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

Sample Input 1

5
1 2 3 4 5
3
3 4 1

Sample Output 1

3

Sample Input 2

3
1 2 3
1
5

Sample Output 2

0

Sample Input 3

5
1 1 2 2 3
2
1 2

Sample Output 3

2

Notes

Solution in C (judge verdict: Accepted)

#include <stdio.h>
int main(void) {

	int S_number, T_number;
	int S_array[100000], T_array[5000];
	int mid;
	int overaycount = 0;

	scanf("%d", &S_number);
	for (int si = 0; si<S_number; si++) {
		scanf("%d", &S_array[si]);
	}

	scanf("%d", &T_number);




	
	for (int ti = 0; ti<T_number; ti++) {
		scanf("%d", &T_array[ti]);
		int left = 0;
		int right = S_number ;
		while (left<right) {
			mid = (left + right) / 2;
			if (S_array[mid] == T_array[ti]) {
				overaycount++;
				break;
			}
			else if (S_array[mid]<T_array[ti]) {
				left = mid + 1;
			}
			else {
				right = mid;
			}
		}
	}
	printf("%d\n", overaycount);
	return 0;
}