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>

main()
{
  int count,i,line1[100000],line2[50000],num1,num2;
  int left,right,mid;
  scanf("%d",&num1);

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

  scanf("%d",&num2);

  for(i=0;i<num2;i++)
    {
      scanf("%d",&line2[i]);
    }
  
  count = 0; 
  for(i=0;i<num2;i++)
    {
      
      left = 0;
      right = num1;

      while(left<right)
	{

	  mid = (left + right)/2;
	  if(line2[i] == line1[mid]){
	    count++;
	    
	    break;
	  }
	  else if(line2[i]>line1[mid])left = mid + 1;
	  else if(line2[i]<line1[mid])right = mid;
	  
	}
    }
  
  printf("%d\n",count);
  return 0;
}