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

int Search(int *,int ,int);

int main(){
  int loop1,loop2;
  int retu1[N],retu2;
  int i,count=0;
 
  scanf("%d",&loop1);
  for(i=0;i<loop1;i++){
    scanf(" %d",&retu1[i]);
  }

  scanf("%d",&loop2);
  for(i=0;i<loop2;i++){
    scanf(" %d",&retu2);
    count+=Search(retu1,retu2,loop1);
  }

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


int Search(int *x,int y,int length){
  int side1=0;
  int side2=length;
  int center=0;

  while(1){
    if(side1>=side2)break;
    center=(side1+side2)/2;
    if(x[center]==y){
      return 1;
    }

    else if(x[center]>y){
      side2=center;
    }

    else if(x[center]<y){
      side1=center+1;
    }
  } 
  return 0;
}