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: Wrong Answer)

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<stdlib.h>
void BinarySearch(unsigned long long p[], unsigned long long key, unsigned long long*,unsigned long long);
int main() {
	unsigned long long n, S[100000] = { 0 }, T[5000] = { 0 }, q, i, cnt = 0;
	unsigned long long *p=S, *key=T;
	scanf("%lld", &n);
	for (i = 0; i < n; i++) scanf("%lld", p + i);
	
	scanf("%lld", &q);
	for (i = 0; i < q; i++) scanf("%lld", key + i);
	
	for (i = 0; i < q; i++) BinarySearch(p, *(key + i), &cnt,n);
	printf("%lld\n", cnt);
	return 0;
}

void BinarySearch(unsigned long long p[], unsigned long long key, unsigned long long *cnt, unsigned long long n){
	unsigned long long l,r,m;
	for (l = 0, r = n; l < r;) {
		m = (l + r) / 2;
		if (*(p + m) == key) { *(cnt) += 1; break; }
		else if (key < *(p + m)) r = m;
		else if (key > *(p + m)) l = m + 1;
	}
}