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>

void BubbleSort(int *);
int BinarySearch(int *,int);
int n,q;

int main(){
  int C[100000];
  int T[50000];
  int i,j,a,c=0;

  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d ",&C[i]);
  }
  scanf("%d",&q);
  for(j=0;j<q;j++){
    scanf("%d",&T[j]);
  }

  /*BubbleSort(&T[0]);*/
     
  for(j=0;j<q;j++){
    a = BinarySearch(&C[0],T[j]);
    c+=a;
  }

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

  return 0;
}

/*void BubbleSort(int * A){
  int i,j,swap;

  for(i=0;i<q;i++){
    for(j=q-1;j>0;j--){
      if(A[j]<A[j-1]){
	swap=A[j-1];
        A[j-1]=A[j];
        A[j]=swap;
      }
    }
  }
  }*/
 

int BinarySearch(int * A, int key){
  int left,right,mid; 
 
  left=0;
  right=n;

  while(left<right){
    mid=(left+right)/2;
    if(key==A[mid]) return 1;
    if(key>A[mid]) left=mid+1;
    else  right=mid;
  }
  return 0;
}