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)

//Binary search

#include<stdio.h>

int main()
{

  int n1 = 0;
  int n2 = 0;
  int i,j;
  int arr1[100000];
  int arr2[50000];
  int mid = 0;
  int count = 0;
  int left = 0;
  int right = 0;

  //input data
  scanf("%d",&n1);

  for(i = 0; i < n1; i++)
    {
      scanf("%d",&arr1[i]);
    }

  scanf("%d",&n2);

  for(j = 0; j < n2; j++)
    {
      scanf("%d",&arr2[j]);
    }

  //work time

  for(j = 0; j < n2 ;j++)
    {
      left = 0;
      right = n1;

      while(left < right)
	{
        
	  mid = (left + right) / 2;
     
	  if(arr1[mid] == arr2[j])
	    {
	      count++;
	      break;
	    }

	  else if(arr2[j] < arr1[mid]) right = mid;

	  else if(arr2[j] > arr1[mid]) left = mid + 1;

	}
    }

  //output data
  printf("%d\n",count);

  return 0;
}