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

int search(int *S, int num, int key){
  int l = 0, m = num/2, r = num;

  while(1){
    if(S[m] > key){
      r = m;
      m = l + (r-l)/2;
    }
    else if(S[m] <key){
      l = m + 1;
      m = l + (r-l)/2;
    }
    else if(S[m] == key){
      return 1;
    }
  }

  return 0;
}

int main(){
  int n, *S, q;
  int i, j, in, count=0;
  int num=0;

  // input data
  scanf("%d",&n);
  S = (int *)malloc(sizeof(int) * n);
  for(i=0; i<n; i++){
    scanf("%d",&S[num++]);
  }
  scanf("%d",&q);
  for(i=0; i<q; i++){
    scanf("%d",&in);
    // search
    count += search(S, num, in);
  } 

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

  return 0;
}