Problem:
Search I

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

n ≤ 10000

q ≤ 500

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
3 1 2
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>

int main()
{
  int n,q,i,j,l,r,m,key,count = 0,temp;
  scanf("%d",&n);
  int S[n];
  for(i = 0;i < n;i++)
    {
      scanf("%d",&S[i]);
    }
  scanf("%d",&q);
  int T[q];
  for(i = 0;i < q;i++)
    {
      scanf("%d",&T[i]);
      //printf("test1\n");
    }
  //printf("%d",q);

  for(i = 0;i < n;i++)
    {
      for(j = 0;j < n;j++)
	{
	  if(S[i] < S[j])
	    {
	      temp = S[i];
	      S[i] = S[j];
	      S[j] = temp;
	    }
	}
    }
  /*for(i = 0;i<q;i++)
    {
      printf("%d",T[i]);
      }*/

  for(i = 0;i < q;i++)
    {
      key =T[i];
      l = 0;
      r = n;
      while(l < r)
	{
	  m = (l + r)/2;
	  //printf("m=%d\n",m);
	  if(key == S[m])
	    {
	      //printf(" %d ",S[m]);
	      count++;
	      break;
	    }
	  if(key > S[m])
	    {
	      l = m + 1;
	    }
	  else if(key <S[m])
	    {
	      r = m;
	    }
	}
      //printf("count%d",count);
    }
  printf("%d\n",count);
  return 0;
}