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 <iostream>
using namespace std;

int binarySearch(long arr[], long arrLen, long key){
	long left = 0;
	long right = arrLen;
	long middle = (left + right) / 2;

	while(left <= right){
		if(arr[middle] > key){
			right = middle - 1;
			middle = (right + left)/2;
		}else if(arr[middle] < key){
			left = middle + 1;
			middle = (left + right)/2;
		}else if(arr[middle] == key){
			return 1;
		}
		//cout << "[" << left << "," << middle << "," << right << "]" << endl;
	}
	return 0;
}

int main(){
	long n, q;
	long S[100000], T[50000];
	int count = 0;

	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> S[i];
	}
	cin >> q;
	for(int i = 0; i < q; i++){
		cin >> T[i];
	}

	for(int i = 0; i < q; i++){
		count += binarySearch(S, n-1, T[i]);
	}
	cout << count << endl;

	return 0;
}