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>
#include<stdlib.h>

#define MAX 100001
#define NOT -1;

int s[MAX],n;

int binarySearch(int t){
  int l,r,mid;
  l = 0;
  r = n;
  while(l < r){
    mid = (l+r)/2;
    if(s[mid] == t)return 1;
    else if(t < s[mid])r = mid;
    else l = mid +1;
  }
  return NOT;
}

int main(){
  int q,sum=0;
  int t;
  int i,j;
  
  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);
    j = binarySearch(t);
    if(j != -1)sum++;
  }


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