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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
typedef long long ll;

vector<int> S;

bool binarysearch(int key){
	int left = 0;
	int right = S.size()-1;
	while(right - left >= 1){
		int mid = left+(right-left)/2;
		if(S[mid] == key) return true;
		else if (S[mid] > key) right = mid -1;
		else if (S[mid] < key) left = mid + 1;
	}
	return false;
}



int main(){
	int n;
	cin >> n;
	S.resize(n);
	rep(i,n){
		cin >> S[i];
	}
	sort(S.begin(),S.end());
	
	int q;
	cin >> q;
	int ans = 0;
	vector<int> T(q);
	rep(i,q){
		cin >> T[i];
		if(binary_search(S.begin(),S.end(), T[i])) ans++;
	}
	
	cout << ans << endl;
    return 0;
}