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 <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <iostream>
static const int NMAX=100000;
static const int QMAX=50000;
int A[NMAX+1];
int n;
int binarySearch(int key){
	int left=0;
	int right=n;
	int mid=0;
	// std::cout << "key = " << key << std::endl;
	// std::cout << "n = " << n << std::endl;
	
	while(left < right){
		mid = (left + right) / 2;
		// std::cout << "left = " << left << std::endl;
		// std::cout << "right = " << right << std::endl;
		// std::cout << "mid = " << mid << std::endl;
		if(key == A[mid]){
			return 1;
		}
		if(key < A[mid]){
			right = mid;
		}else if(key > A[mid]){
			left = mid+1;
		}
	}
	return 0;
}
int main(int argc, char const* argv[])
{
	
	// int i,j,k;
	int q;
	// int *S,*T;
	// int S[NMAX+1];
	// int T[QMAX+1];
	int T;
	int c=0;
	// S = (int*)malloc(sizeof(int)*n);
	// T = (int*)malloc(sizeof(int)*q);
	std::cin >> n;
	// std::cout << n << std::endl;
	for(int i = 0;i < n;i++) scanf("%d",&A[i]);
	// for(int i = 0;i < n;i++) std::cout << A[i] << std::endl;
	std::cin >> q;
	// std::cout << q << std::endl;
	for(int i = 0;i < q;i++){
		scanf("%d",&T);
		// std::cout << T << std::endl;
		if(binarySearch(T))c++;
	}
	std::cout << c << std::endl;
	return 0;
}