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: Time Limit Exceeded)

#include <stdio.h>
#include <stdlib.h>

int isIn(int, int *, int);

int main(void)
{
  int n, q, i, count=0;
  scanf(" %d", &n);
  int *nArray = (int *) malloc(sizeof(int[n]));
  for (i=0; i<n; i++)
    scanf(" %d", nArray+i);
  scanf(" %d", &q);
  int *qArray = (int *) malloc(sizeof(int[q]));
  for (i=0; i<q; i++)
    scanf(" %d", qArray+i);
  for (i=0; i<q; i++)
    if (isIn(qArray[i], nArray, n))
      count++;
  printf("%d\n", count);
  return 0;
}

int isIn(int number, int *array, int length)
{
  int bottom=0, top=length-1;
  while (bottom!=top)
    {
      int mid=(bottom+top)/2;
      if (array[mid]==number)
	return 1;
      else if (array[mid]<number)
	bottom=mid;
      else
	top=mid;
    }
  return 0;
}