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"
struct num
{
  int n;
  struct num *next;
};
int binarySearch(int *A,int n,int key)
{
  int mid;
  int left=0;
  int right;
  right=n;
  while(left<right)
    {
      mid=(left+right)/2;
      if(key==A[mid])
        {
          return mid;
        }
      else if(A[mid]<key)
        {
          left=mid+1;
        }
      else if(key<A[mid])
        {
          right=mid;
        }
    }
  return -1;
}
int main()
{
  int i,j;
  int *S;
  int n;
  int m;
  struct num *T;
  struct num *p;
  int q;
  int C=0;
  T=(struct num*)malloc(sizeof(struct num));
  scanf("%d",&n);
  S=(int*)malloc(sizeof(int)*n);
  for(i=0;i<n;i++)
    {
      scanf("%d",&S[i]);
    }
  scanf("%d",&q);
  for(i=0;i<q;i++)
    {
      scanf("%d",&m);
      for(p=T;p->next!=NULL;p=p->next)
        {
          if(p->next->n==m)break;
        }
      if(p->next==NULL)
        {
          p->next=(struct num*)malloc(sizeof(struct num));
          p->next->n=m;
          p->next->next=NULL;
        }
    }
  for(p=T->next;p!=NULL;p=p->next)
    {
      if(binarySearch(S,n,p->n)!=-1)
        {
          C++;
        }
    }
  printf("%d\n",C);
  return 0;
}