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<stdlib.h>
#include<algorithm>
using namespace std;

void quick_sort(int* D,int B,int T){
  if(B>=T)return;
  int i=B,j=T;
  int div=D[B];

  while(i<j){
    while(i<=j&&D[i]<=div)i++;
    while(i<=j&&D[j]>div)j--;
    if(i<j)swap(D[i],D[j]);
  }
  int tmp=D[B];D[B]=D[j];D[j]=tmp;
  quick_sort(D,B,j-1);
  quick_sort(D,j+1,T);
}

bool binarysearch(int x,int* D,int n){
    int B=0;
    int T=n-1;

    while(B<=T){
      int mid=(B+T)/2;
      if(D[mid]==x){return true;}
      else if(D[mid]<x){B=mid+1;}
      else T=mid-1;
    }
    return false;
}

int main(){
  int n;
  cin>>n;
  int S[n];
  for(int i=0;i<n;i++)cin>>S[i];
  int q;
  cin>>q;
  int T[q];
  for(int i=0;i<q;i++)cin>>T[i];
  quick_sort(S,0,n-1);
  int cnt=0;
  for(int i=0;i<q;i++){
    if(binarysearch(T[i],S,n))cnt++;
  }
  cout<<cnt<<endl;
}