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>
#include<string.h>
#include <stdlib.h>
int se(int*,int,int);

int main(){
  int i,j,s,t,n[1000000],q[50000],cnt=0;
  scanf("%d",&s);
  for(i=0;i<s;i++){
    scanf("%d",&n[i]);
  }
  scanf("%d",&t);
  for(i=0;i<t;i++){
    scanf("%d",&q[i]);
    //printf("%d ",q[s]);
  }
  for(j=0;j<t;j++){
    if (se(n,q[j],s)) cnt++; 
  }
  printf("%d\n",cnt);

  
  
}
int se(int *n,int key,int s){
  int l,r,m;
  l=0;
  r=s;
  m=s/2;
  while(n[m] != key){
    if(key <n[l] ||key >n[r-1]) return 0;
    if(n[m]>key)r=m;
    else l=m+1;
    m=(l+r)/2;
  }
  //  printf("%d %d - \n",n[m],key);
  return 1;
  
}