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(){

  int n,q,i,j,k,C=0,l=0,m,r;
  int S[100000];
  int T[50000];

  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&S[i]);
  }
  scanf("%d",&q);
  for(i=0;i<q;i++){
    scanf("%d",&T[i]);
  }

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