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 binary_search(long long *list, int s_ind, int e_ind, long long search_val)
{
	if (s_ind >= e_ind) {
		return list[s_ind] == search_val ? s_ind : -1;
	}

	int mid_ind = s_ind + ((e_ind - s_ind) / 2);

	if (list[mid_ind] < search_val) {
		return binary_search(list, mid_ind+1, e_ind, search_val);
	}
	else if (list[mid_ind] > search_val) {
		return binary_search(list, s_ind, mid_ind-1, search_val);
	}
	else {
		return mid_ind;
	}
}

int main(int argc, char *argv[])
{
	int i, n, q, cnt;
	long long S[100000];
	scanf("%d", &n);
	for (i = 0; i < n; i++) {
		long long num;
		scanf("%lld", &num);
		S[i] = num;
	}

	cnt = 0;
	scanf("%d", &q);
	for (i = 0; i < q; i++) {
		long long num;
		scanf("%lld", &num);
		if (binary_search(S, 0, n - 1, num) > -1) {
			++cnt;
		}
	}

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