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>
using namespace std;
int s[100001];

int nibun(int k,int n){
  int h,t;
  h=0;
  t=n;
  while(h<t){
    if(k==s[(h+t)/2]){
      return 1;
    }else if(k<s[(h+t)/2])t=(h+t)/2-1;
    else if(k>s[(h+t)/2])h=(h+t)/2;
  }
  return 0;
}

int main(){
  int n,q,t,h,k;
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>s[i];
  }
  cin>>q;
  for(int i=0;i<q;i++){
    h=0;
    cin>>t;
    h=nibun(t,n);
    if(h==1)k++;
  }
  cout<<k<<endl;
  return 0;
}