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

#define N 100000

int main(){

  int input_m[N], serch_m[500], m, n, i, j, Le, Mi, Ri, c=0, f;

  scanf("%d", &n);

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

  scanf("%d",&m);

  for( i = 0; i < m; i++)scanf("%d", &serch_m[i]);

  for( j = 0; j < m; j++){
    f =0;
  Le = 0;
  Ri = n + 1;
  Mi = (Le + Ri) / 2;
  while(Le < Ri){

    if( input_m[Mi] == serch_m[j]){
      f = 1;
      break;
    }

    else if ( input_m[Mi] < serch_m[j]){
      Le = Mi;
      Mi = (Le + Ri) / 2;
    }

    else if( input_m[Mi] > serch_m[j]){
      Ri = Mi + 1;
      Mi = (Le + Ri) / 2;
    }
  }
  if( f == 1)c++;
}

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

return 0;
    }