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>

#define N_MAX 100000
#define Q_MAX 50000

int binarysearch(int n,int* a,int key){
	int l=0;
	int r=n;
	int mid;
	while(l<r){
		mid=(l+r)/2;
		if(a[mid]==key){
			return mid;
		}else if(key<a[mid]){
			r=mid;
		}else{
			l=mid+1;
		}
	}return N_MAX+1;
}

int main(void){

	int A[N_MAX+1];
	int n;
	int B[Q_MAX+1];
	int q;
	int s=0;
	
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&A[i]);
	}
	scanf("%d",&q);
	for(int i=0;i<q;i++){
		scanf("%d",&B[i]);
	}
	
	for(int i=0;i<q;i++){
		if(binarysearch(n,A,B[i])!=N_MAX+1)s++;

	}
	
	printf("%d\n",s);
	
	return 0;
}