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>
int main(void){
  int i;
  int left,light,mid;
  int c=0;
  int N1,N2;
  int A[100000];
  int B[50000];

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

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

  for(i=0;i<N2;i++){
    left=0;
    light=N1;
    while(1){
      mid=(left+light)/2;
      if(A[mid]<B[i])left=mid+1;
      else if(A[mid]>B[i])light=mid;
      else{
	c++;
	break;
      }
      if(A[i]>A[i+1]){
	i=N2;
	break;
      }
    }
  }
  printf("%d\n",c);
}