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>

#define N 100000

int binary(int *,int,int);

int main(){
  int pre,nex,i,cnt=0;
  int a[N],b[N];

  scanf("%d",&pre);
  for(i=0;i<pre;i++) scanf("%d",&a[i]);

  scanf("%d",&nex);
  for(i=0;i<nex;i++){
    scanf("%d",&b[i]);
    cnt += binary(a,b[i],pre);
  }

  printf("%d\n",cnt);

  return 0;
}

int binary(int *a,int b,int cut){
    int left = 0,p=0,right=cut,mid;

    while(left <= right) {
        mid = (left + right) / 2; /* calc of middle key */
        if (a[mid] == b) {
            p++;
            break;
        } else if (a[mid] < b) {
            left = mid + 1; /* adjustment of left(start) key */
        } else {
            right = mid - 1; /* adjustment of right(end) key */
        }
    }
    return p;
}