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 BS(int *a,int *b,int mid,int n,int m);
int main(){
  int a[100000];
  int b[50000];
  int n,m,i,j,cnt,mid;
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&a[i]);
  }
  scanf("%d",&m);
  for(i=0;i<m;i++){
    scanf("%d",&b[i]);
  }
if(n%2!=0){
  mid=(n+1)/2;
}
else{
  mid=(0+n)/2;
}
  /*printf("%d\n",mid);*/
  cnt=BS(a,b,mid,n,m);

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


int BS(int *a,int *b,int mid,int n,int m){
  int cnt=0,i,j;
  for(i=0;i<m;i++){
    if(b[i]==a[mid]){
      cnt++;
    }
    else if(b[i]<a[mid]){
      for(j=mid-1;j>=0;j--){
        if(a[j]==b[i]){
          cnt++;
          break;
        }
      }
    }

    else if(b[i]>a[mid]){
      for(j=mid+1;j<n;j++){
        if(a[j]==b[i]){
          cnt++;
          break;

        }
      }
    }

  }
  return cnt;
}