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>
#define N 100000
#define Q 50000

int main(){

  int i,j,x,y,b;
  int s[N],t[Q],a=0,mid,left,right;

  scanf("%d",&x);

  for(i=0;i<x;i++){
    scanf("%d",&s[i]);
  }

  scanf("%d",&y);

  for(j=0;j<y;j++){
    scanf("%d",&t[j]);
  }


  for(b=0;b<y;b++){

  left=0;
  right=x;

  while(left<right) // left<rightの限りずっと続く
    mid=(left+right)/2;
  if(s[mid]==t[b]){
    a++;
    break;
  }
  else if(t[b]<s[mid])
    right=mid;
  else if(t[b]>s[mid])
    left=mid;

  }

  printf("%d\n",a);
  return 0;
}