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<stdlib.h>

int ascending(const int *a, const int *b){
  return(*a - *b);
}

  int n,q;
  int S[100000];
  int T[50000];
  int C = 0;

  int solve(int mid,int key){
    if(T[mid] >= key){
      return 1;
    }else{
      return 0;
    }
  }

  int binary_search(int key){
    int ok = q;
    int ng = -1;
    while( abs (ok - ng) > 1){
      int mid = (ok + ng) / 2;
      if(solve(mid,key) == 1){
        ok = mid;
      }else{
        ng = mid;
      }
    }
    if(T[ok] == key){
      C ++;
    }
  }

int main(){

  scanf("%d",&n);
  for(int i=0; i<n; i++){
    scanf("%d",&S[i]);
  }
  scanf("%d",&q);
  for(int i=0; i<n; i++){
    scanf("%d",&T[i]);
  }

  qsort(T,q,sizeof(int),ascending);
  qsort(S,n,sizeof(int),ascending);  

  for(int i=0; i<n; i++){
    if(i == 0){
      binary_search(S[i]);
    }else{
      if( S[i] > S[i-1] ){
        binary_search(S[i]);
      }
    }
  }

  printf("%d\n",C);

  return 0;
}