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 search(int *,int,int);
int main() {
	int a[100000], b[100000], an, bn,i,j,num,key,ans = 0;
	scanf("%d", &an);
	num = 0;
	for ( i = 0; i < an ; i++)
	{
		scanf("%d", &key);
		if (i > 0 && a[i - 1 - num] == key)
		{
			num++;
		}
		else
		{
			a[i - num] = key;
		}
	}
	an -= num;
	scanf("%d", &bn);
	for ( i = 0; i < bn; i++)
	{
		scanf("%d", &b[i]);
	}
	for (i = 0; i < bn; i++)
	{
		ans += search(a, an, b[i]);
	}
	printf("%d", ans);
	printf("\n");
	
	return 0;
}
int search(int *x,int right, int y) {
	int left =0, mid;
	while (left < right)
	{
		mid = (left + right) / 2;
		if (x[mid] == y)
		{
			return 1;
		}
		else
		{
			if (x[mid] > y)
			{
				right = mid;
			}
			else
			{
				if (x[mid] < y)
				{
					left = mid + 1;
				}
			}
		}
	}
	return 0;
}