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>

int bin_search(const int a[], int n, int key){
	int pl = 0;
	int pr = n-1;

	do{
		int pc = (pl + pr) / 2;
		if (a[pc] == key){
			return 1;
		}else if (a[pc] < key){
			pl = pc + 1;
		}else{
			pr = pc - 1;
		}
	}while(pl <= pr);

	return -1;
}

int main(void)
{
	int i, j, nx, ny, k;
	int count = 0;
	int *x, *y;

	//S???????´???°??\???
	scanf("%d", &nx);
	x = calloc(nx, sizeof(int));

	//S?????´??°??????
	for (i = 0; i < nx; i++)
	{
		scanf("%d", &x[i]);
	}

	//T???????´???°??\???
	scanf("%d", &ny);
	y = calloc(ny, sizeof(int));

	//T?????´??°??????
	for (j = 0; j < ny; j++)
	{
		scanf("%d", &y[j]);
	}

	//??????C??????
	for (k = 0; k < ny; k++)
	{
		if (bin_search(x , nx, y[k]) == 1){
			count += 1;
		}
	}
	printf("%d\n", count);

	free(x);
	free(y);

	return 0;
}