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 binary(int n,int *s,int t){
  int mid,right,left;
  right = n;
  left = 0;
  mid = (right + left)/2;
  while(left != mid){
    mid = (left + right)/2;
    if(s[mid] < t) left = mid+1;
    else if(s[mid] > t) right = mid;
    else if(s[mid] == t) return 1;
  }
  return 0;
}

int main(){
  int n,q;
  int s[100000],t[50000];
  scanf("%d",&n);
  int i;
  for (i=0;i<n;i++) scanf("%d",&s[i]);
  scanf("%d",&q);
  for(i=0;i<q;i++) scanf("%d",&t[i]);
  int count=0;
  for (i=0;i<q;i++){
    if(binary(n,s,t[i])) count++;
  }
  printf("%d\n",count);
  return 0;
}