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>
#define N 100000
int bs(int*, int, int);

int main(){
  int n, q, k;
  int i, j, num=0;
  int s[N]={0}, t[N][2]={0};

  scanf("%d", &n);
  for ( i = 0; i < n; i++ ) scanf("%d", &s[i]);
  scanf("%d", &q);
  for ( i = 0; i < q; i++ ) scanf("%d", &t[i][0]);

  for( i = 0 ; i < q ; i++){
    if(bs(s, t[i][0], n)!=-1){
      t[i][1] = 1;
    }
  }

  for( j=0 ; j < q ; j++){
    if(t[j][1]==1){
      num++;
    }
  }

  printf("%d\n" ,num);
  return 0; // Don't forget return 0
}

int bs(int* a_p, int key, int n){
  int left  = 0;
  int right = n;
  int mid   = 0;
  while( left < right ){
    mid = (left+right)/2;
    if( key == a_p[mid]){
      return mid;
    }else if( key > a_p[mid]){
      left = mid + 1;
    }else if( key < a_p[mid]){
      right = mid;
    }
  }
  return -1;
}