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 <math.h>
#define MAX_N 100001
 
void swap(int *a, int *b) {
  int tmp = *a;
  *a = *b;
  *b = tmp;
}
 
void quick_sort(int *begin, int *end) {
  int n = end - begin;
  int p, i;
  if(n < 1) return;
  swap(begin, begin+rand()%n);
  p = 0;
  for(i = 1; i < n; ++i) {
    if(begin[i] < begin[0]) {
      ++p;
      swap(begin+p,begin+i);
    }
  }
  swap(begin+p, begin);
  quick_sort(begin,begin+p);
  quick_sort(begin+p+1,end);
}
 
int binarry_search(int *begin, int *end, int value) {
  int l, r, m;
  l = 0;
  r = end-begin;
  while(l < r) {
    m = (l+r)/2;
    if(begin[m] == value)
      return 1;
    else if(begin[m] < value) 
      l = m+1;
    else
      r = m;
  }
  return 0;
}
 
int main() {
  int n, q, S[MAX_N], t, num;
  int i;
  scanf("%d", &n);
  for(i = 0; i < n; ++i) {
    scanf("%d", S+i);
  }
  quick_sort(S,S+n);
  num = 0;
  scanf("%d", &q);
  while(q--) {
    scanf("%d", &t);
    if(binarry_search(S,S+n,t)) ++num;
  }
  printf("%d\n", num);
  return 0;
}