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 a[1000000],b;

int serch(int key){
  int l=0,r=b,mid;
  while(l<r){
    mid=(l+r)/2;
    if(key==a[mid]) return 1;
    if(key>a[mid]) l=mid+1;
    else if(key<a[mid])r=mid;
  }
  return 0;
}

int main(){
  int i,d,e,sum=0;
    scanf("%d",&b);
  for(i=0;i<b;i++){
    scanf("%d",&a[i]);
  }

  scanf("%d",&d);
  for(i=0;i<d;i++){
    scanf("%d",&e);
    if(serch(e)) sum++;
  }

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

    return 0;
}