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,m,i,a[10000],b[10000],k,j,x,y,z;
  m=0;
  
  scanf("%d",&n);

  for(i=0;i<n;i++){
    scanf("%d",&a[i]);
  }
  scanf("%d",&k);
  for(i=0;i<k;i++){
    scanf("%d",&b[i]);
  }
 

  for(j=0;j<k;j++){
    x=n;
    y=0;
    while(x>=y){
      z=(x+y)/2;    
      if(a[z]>b[j]){
	x=z;
      }
      else if(a[z]<b[j]){
	y=z+1;
      }
      else if(a[z]==b[j]){
	m++;
	break;
      }
    }

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