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>
#define N 100000
#define Q 50000
 
int search(int[],int[],int,int);
 
int main(void){
  
  int S[N];
  int T[Q];
  int n,q;
  int i;
  int count=0;
  
  scanf("%d",&n);
  
  for(i=0;i<n;i++)
    scanf("%d",&S[i]);
  
  scanf("%d",&q);
  
  for(i=0;i<q;i++)
    scanf("%d",&T[i]);
  
  count = search(S,T,n,q);
  
  printf("%d\n",count);
  
  return 0;
}

int search(int S[],int T[],int n,int q){
  
  int i;
  int flag;
  int count=0;
  int min=0;
  int max = n-1;
  int mid;
  
  
  for(i=0;i<q;i++){
    flag=0;
    min = 0;
    max = n-1;
    while(min <= max){
      mid = (min+max)/2;
      
      if(S[mid] == T[i]){
	flag = 1;
	break;
      }
      
      else if(S[mid] < T[i])
	min = mid +1;
      
      else if(S[mid] > T[i])
	max = mid -1;
    }
    if(flag ==1)
      count++;

  }
  
  return count;
}