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>

int Binary(int);

int S[100000],ns;

int main(){
  int  nt, i, C=0;
  int T[100000];

  scanf("%d", &ns);

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

  scanf("%d", &nt);

  for( i = 0 ; i < nt ; i++ ){
    scanf("%d", &T[i]);
    if(Binary(T[i])){
       C++;
     }
  }

  printf("%d\n", C);
  return 0;
}

int Binary(int t){
  int l=0, r=ns, mid;
  while( l < r ){
    mid = ( l + r ) / 2;
    if( t == S[mid] ) {
      return 1;
    }
    if( t > S[mid] ){
      l = mid + 1;
    }
    else if( t < S[mid] ) {
      r = mid;
    }
  }
  return 0;
}