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 MAX1 100000
#define MAX2 50000
void Search(int *,int);

int count=0;
 int right=0,left=0,mid=0;
int m;
int main()
{
  int n,i,j;
  int s[MAX1],t[MAX2];

  //ここからscan
  scanf("%d",&m);
  for(i=0;i<m;i++)
    {
      scanf("%d",&s[i]);
    }
  scanf("%d",&n);
  for(i=0;i<n;i++)
    {
      scanf("%d",&t[i]);
    }
  //ここまで
  for(i=0;i<n;i++)
    {
      Search(s,t[i]);
    }
  printf("%d\n",count);
  return 0;
}

void Search(int *A,int key)
{
  left = 0;
  right = m;
  while(left<right)
    {
      mid = (left + right)/2;
      if(key==A[mid])
	{
	  count+=1;
	  break;
	}
      else if(key > A[mid])
	{
	  left = mid + 1;
	}
      else if(key < A[mid])
	{
	  right = mid;
	}
    }
}