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

bool bin(int A[], int n, int s) {

	int h = n / 2;
	if (A[h] == s) {
		return true;
	} else if (A[h] > s && h > 0) {
		return bin(A, h, s);
	} else if (A[h] < s && h < n - 1) {
		return bin(&A[h + 1], n - h - 1, s);
	} else {
		return false;
	}

}

int main()
{
	int n;
	scanf("%d", &n);
	int S[100000];
	for (int i = 0; i < n; ++i) {
		scanf("%d", &S[i]);
	}

	int q;
	scanf("%d", &q);
	int count = 0;
	for (int i = 0; i < q; ++i) {
		int t;
		scanf("%d", &t);
		if (bin(S, n, t)) ++count;
	}
	cout << count << endl;
}