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;

bool contains(int *arr, int length, int key);

int main() {
	int n;
	cin >> n;
	int S[n];
	for (int i = 0; i < n; ++i) {
		cin >> S[i];
	}
	int q;
	cin >> q;
	int ans = 0;
	for (int i = 0; i < q; ++i) {
		int T;
		cin >> T;
		if (contains(S, n, T)) {
			++ans;
		}
	}
	cout << ans << endl;
	return 0;
}

bool contains(int *arr, int length, int key) {
	int left = 0;
	int right = length;
	while (left < right) {
		int mid = (left + right) / 2;
		if (arr[mid] == key) {
			return true;
		} else if (key < arr[mid]) {
			right = mid;
		} else {
			left = mid + 1;
		}
	}
	return false;
}