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++14 (judge verdict: Accepted)

#include <iostream>
#include <vector>

/*
find 2

1 2 3 4 5 6 7 8 9
l       m       r
1 2 3 4 5 6 7 8 9
l   m   r
1 2 3 4 5 6 7 8 9
l m r

find 6

1 2 3 4 5 6 7 8 9
l       m       r
1 2 3 4 5 6 7 8 9
          l m   r
1 2 3 4 5 6 7 8 9
          m r
*/

void printVector(std::vector<int> &a) {
  int n = (int)a.size();
  for (int i = 0; i < n; i++) {
    std::cout << a[i];
    if (i < n - 1)
      std::cout << " ";
    else
      std::cout << std::endl;
  }
}

void printMark(int l, int r, int m, int n) {
  if (l == m)
    l = -1;
  if (r == m)
    r = -1;
  for (int i = 0; i < n; i++) {
    if (i == l)
      std::cout << 'l';
    else if (i == r)
      std::cout << 'r';
    else if (i == m)
      std::cout << 'm';
    else
      std::cout << " ";
    std::cout << " ";
  }
  std::cout << std::endl;
}

int binarySearch(std::vector<int> s, int x) {
  int n = (int)s.size(), l = 0, r = n, m;
  // std::cout << "find: " << x << std::endl;
  while (l < r) {
    m = (l + r) / 2;
    // printVector(s);
    // printMark(l, r, m, n);
    if (s[m] == x) return m;
    else if (x < s[m]) r = m;
    else l = m + 1;
  }
  return -1;
}

std::vector<int> *read() {
  int n;
  std::cin >> n;
  auto *s = new std::vector<int>(n, 0);
  for (int i = 0; i < n; i++) {
    std::cin >> s->at(i);
  }
  return s;
}

int main() {
  auto s = *read(), t = *read();
  int count = 0;
  for (int i = 0; i < (int)t.size(); i++) {
    if (binarySearch(s, t[i]) >= 0) {
      count++;
    }
  }
  std::cout << count << std::endl;
}