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>
#include <vector>

bool includeNum(int fig, std::vector<int> S){
	int left = 0;
	int right = S.size();
	int center;

	while(right>left){
		center = (right+left)/2;
		if(S[center]<fig){
			left = center + 1;
		}else if(S[center]>fig){
			right = center;
		}else{
			return true;
		}
	}

	return false;
}

int main(int argc, char const *argv[]){

	int N,fig;
	int cnt = 0;

	std::vector<int> S;
	std::cin >> N;
	for (int i = 0; i < N; ++i){
		std::cin >> fig;
		S.push_back(fig);
	}
	std::cin >> N;
	for (int i = 0; i < N; ++i){
		std::cin >> fig;
		if(includeNum(fig,S)) cnt++;
	}

	std::cout << cnt << std::endl;
	return 0;
}