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: Runtime Error)

#include<stdio.h>
#define n_find 0
#define find 1
int b_search(int);
void sort();
void swap(int);
int n;
int q;
int l[10000];
int main(){
  int i;
  int q_n;
  int result=0;
  scanf("%d",&n);
  for(i=0;i<n;i++)scanf("%d",&l[i]);
  sort();
  scanf("%d",&q);
  for(i=0;i<q;i++){
    scanf("%d",&q_n);
    result+=b_search(q_n);
  }
  printf("%d\n",result);
  return 0;
}
int b_search(int x){
  int i;
  int left=0;
  int right=n;
  int mid;
  int flag=0;
  while(left<right){
    mid=(left+right)/2;
    if(l[mid]==x)return find;
    else if(x<l[mid])right=mid;
    else left=mid+1;
  }
  return n_find;
}
void sort(){
  int i;
  int j;
  for(i=n-1;i>-1;i--){
    for(j=i;j<n-1;j++){
      if(l[j]>l[j+1])swap(j);
    }
  }
}
void swap(int x){
  int temp;
  temp=l[x];
  l[x]=l[x+1];
  l[x+1]=temp;
}