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 binarysearch(int N, int Q, int n[], int q[]){
	int i, mid, first, last;
	int count = 0;
	for(i = 0; i < Q; i++){
		first = 0;last = N;
		while(first < last){
			mid = (first + last) / 2;
			if(q[i] == n[mid]){
				count++;
				break;
			}
			else if(q[i] < n[mid]){
				last = mid;
			}
			else{
				first = mid + 1;
			}
		}
	}
	return count;
}

int main(void){
	int N, Q, i;
	int n[100000], q[50000];
	
	scanf("%d", &N);
	for(i = 0; i < N; i++){
		scanf("%d", &n[i]);
	}
	scanf("%d", &Q);
	for(i = 0; i < Q; i++){
		scanf("%d", &q[i]);
	}
	printf("%d\n", binarysearch(N, Q, n, q));
	return 0;
}