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>
#include <stdlib.h>

unsigned long long s[100000];

int binary_search(unsigned long long val_t,unsigned long long min,unsigned long long max)
{
	int i = min;
	int j = max;
	int p;
	while(i<=j){
		p = (i+j)/2;
		if(s[p] > val_t){
			j = p - 1;
		}
		else if(s[p] < val_t){
			i = p + 1;
		}
		else if(s[p] == val_t){
			return 1;
		}
	}
	return 0;
}
int main()
{
	unsigned long long i;
	unsigned long long n;
	unsigned long long q;
	
	scanf("%lld",&n);
	for(i=0;i<n;i++){
		scanf("%lld",&s[i]);
	}

	scanf("%lld",&q);
	unsigned long long t[q];

	for(i=0;i<q;i++){
		scanf("%lld",&t[i]);
	}

	unsigned long long cnt=0;
	for(i=0;i<q;i++){
		if(binary_search(t[i],0,n) == 1){
			cnt++;
		}
	}

	printf("%lld\n",cnt);
	return 0;	
}