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>
//all 1

/* マクロの定義 */
#define N 100000
#define Q 50000
//all 2

//all 1

/* グローバル変数宣言 */
int n=0;
int q=0;
//all 2

int search(int *,int);

main() 
{
  int i=0,j,tmp;
  int S[N];
  int T[Q];
  int val=0;

  /* n個を決定 */
  scanf("%d",&n);

  /* Sの要素 */
  for(i = 0; i < n; i++) {
    scanf("%d", &S[i]);
  }



  //sort
  for(i=0;i<n;i++)
    {
      for(j=i;j<n;j++)
	{
	  if(S[i]>S[j])
	    {
	      tmp=S[i];
	      S[i]=S[j];
	      S[j]=tmp;
	    }
	}
    }

  /* q個を決定 */
  scanf("%d", &q);

  /* Tの要素*/
  for(i = 0; i < q; i++) {
    scanf("%d", &T[i]);
  }

  /*  */
  for(i = 0; i < q; i++) {
  val += search(S, T[i]);
  }

  printf("%d\n",val);

  return 0;
}


int search(int *S,int key)
{
  int left=0,right=n-1,center;
  while(1)
    {
      if(S[right]==key||S[left]==key)
	return 1;
      if(right<=left)
	return 0;
      center=left+(right-left)/2;
      if(S[center]==key)
	return 1;
      else if(S[center]>key)
	{
	  right=center-1;
	}
      else
	{
	  left=center+1;
	}
    }
}