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 buf 1000001
int i,j,a,c,d,cnt=0,b[buf],left,right,mid,key;
void binary_search(int d);

int main(void){
	scanf("%d",&a);
	for(i=0;i<a;i++)
		scanf("%d",&b[i]);
	scanf("%d",&c);
	for(j=0;j<c;j++){
		scanf("%d",&d);
    		binary_search(d);
	}
	printf("%d\n",cnt);
	return 0;
}

void binary_search(int d){
	left = 0;
	right = a;
	while(left < right){
		mid = (left + right)/2;
		if(b[mid] == d){
			cnt++;
			break;
		}
        	else if(d < b[mid])
            		right = mid;
        	else if(d > b[mid])
            		left = mid+1;
	}
}