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 SMAX 100000
#define TMAX 50000

int main(){

  int i, j, temp, count, snum, tnum, left, right, mid;
  
  int sdata[SMAX];
  int tdata[TMAX];

  count = 0;
  

  //入力
  scanf("%d", &snum);

  for(i = 0; i < snum; i++){

    scanf("%d", &sdata[i]);

  }
 
  scanf("%d", &tnum);

  for(i = 0; i < tnum; i++){

    scanf("%d", &tdata[i]);

  }


  //ソート
  /* for(i = 0; i < snum - 1; i++){

    for(j = snum - 1; j > i; j--){

      if(sdata[j] < sdata[j - 1]){
	
	temp = sdata[j - 1];

	sdata[j - 1] =  sdata[j];

	sdata[j] = temp;
	
      }
	
    }
     
    }*/
  

  //検索
  for(i = 0; i < tnum; i++){

    left = 0;
    
    right = snum;

    while(left < right){

      mid = ((left + right) / 2);

      if(tdata[i] == sdata[mid]){

	count++;
	//printf("%d ",tdata[i]);
	break;

      }

      else if(tdata[i] > sdata[mid]){

	left = mid + 1;

	while(sdata[left] == sdata[left + 1]){
	  
	  left++;

	}

      }

      else{

	right = mid;

	while(sdata[right] == sdata[right -1]){
	  
	  right--;
  
	}

      }

    }

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

  return 0;

}