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: Time Limit Exceeded)

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;


int main(){
	int n[10000],q,x,y,s=0;
	int l,r,c;
	cin >> x;
	for(int i=0; i<x ; i++) cin >> n[i];
	cin >> y;
	for(int i=0; i<y; i++){
		cin >> q;
		l = 0;
		r = x;
		while( l<=r ){
			c = ( l=r )/2;
			if( n[c]<q ){
				l = c+1;
			}else if( n[c]>q ){
				r = c-1;
			}else{
				s++;
				break;
			}
		}
	}

	cout << s << "\n";
	return 0;
}