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 MAXS 10000
#define MAXT 500

int search(int *A, int n, int key);

int main(){

  int i,j,k,n,q,T;

  int cnt=0;

  scanf("%d",&n);

  int S[n];

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

  }

  scanf("%d", &q);



  /* 

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

  for(i=0;i<n;i++){
    
    printf("%d", S[i]);

  }

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

  for(i=0;i<q;i++){
    
    printf("%d",T[i]);

  }

  printf("\n", n);

  */

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

    scanf("%d", &T);

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

    if(search(S, n, T)){

      cnt++;

    }

  }

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

int search(int *A, int n, int key){

  int left=0;

  int right=n;

  while(left<right){

    if(A[n/2]==key) return n/2;
    else if(key<A[n/2]) right=n/2;
    else left=n/2+1;

  }

}