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: Accepted)

#include<stdio.h>
int linearSearch(int );
int main(){
  int x,i,j;
  int cont=0;
  scanf("%d",&x);
  int n;
  n=x+1;
  int a[n];
  for(i=0;i<x;i++)scanf("%d",&a[i]);
  int y,l,r,mid;
  scanf("%d",&y);
  int b[y];
  for(i=0;i<y;i++)scanf("%d",&b[i]);
  for(j=0;j<y;j++){
    l=0;
    r=x;
    while(l<r){
      mid=(l+r)/2;
      if(a[mid]==b[j]){
	cont++;
	break;
      }
      else if(b[j]<a[mid])r=mid;
      else l=mid+1;
    }
  }
  printf("%d\n",cont);
  return 0;
}