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: Time Limit Exceeded)

#include <iostream>
using namespace std;
int n;
inline int search(int a[], int key) {
	int l = 0;
	int r = n;
	while (r != l) {
		int mid = (l + r) / 2;
		if (a[mid] = key)
			return 1;
		else if (a[mid] < key)
			l = mid + 1;
		else if (a[mid] > key)
			r = mid;
	}
	return 0;
}
int main() {
	const int num = 10001;
	int ar[num], q, key, sum;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> ar[i];
	}
	cin >> q;
	for (int i = 0; i < q; i++) {
		cin >> key; 
		if (search(ar, key)) sum++;
	}
	cout << sum << endl;
	return 0;

}