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>


int main(){

  long i;
  long n, q;
  long S[100001], T[50001];
  long mc; //matchCounter
  long ps, pe; //pointStart, pointEnd
  long cp; //checkPoint

  scanf( "%ld", &n );

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

  scanf( "%ld", &q );
  
  for( i=0; i<q; i++ )
    scanf( "%ld", &T[i] );

  mc=0;
  for( i=0; i<q; i++ ){

    // case 1
    if( T[i] > S[n-1] ) continue;

    // case 2
    ps = 0; pe = n;
    while( ps < pe ){
      cp = ps + (pe - ps) / 2;
      if( T[i] == S[cp]){ 
        mc++;
        break;
      }
      if( T[i] < S[cp]) pe = cp;
      if( T[i] > S[cp]) ps = cp;
    }
  }


  printf( "%ld\n", mc );

  return 0;
}