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: Time Limit Exceeded)

#include <stdio.h>

int linear_search(int s[], int mid,  int key) {
  int i = 1;
  int before, next;
  int count = 1;
  before = mid - 1;
  next = mid + 1;
  while(s[before] != key && s[next] != key) {
    if (s[before] == key) {
      count++;
    }
    if (s[next] == key) {
      count++;
    }
    before--;
    next++;
  }
  return count;
}

int binary_search(int s[], int n, int key) {
  int left = 0;
  int right = n;
  int mid;
  while(left < right) {
    mid = (left + right) / 2;
    if (s[mid] == key) {
      return linear_search(s, mid, key);
    }
    else if (s[mid] > key) {
      right = mid;
    }
    else if (s[mid] < key) {
      left = mid;
    }
  }
  return 0;
}
  
int main(void) {
  int n ,q;
  int s[10001];
  int t[50000];
  int i;
  int count = 0;
    
  scanf("%d", &n);
  for (i = 0; i < n; i++)
    scanf("%d", &s[i]);
  scanf("%d", &q);
  for (i = 0; i < q; i++)
    scanf("%d", &t[i]);
  
  for (i = 0; i < q; i++) {
    count += binary_search(s, n, t[i]);
  }
  
  printf("%d\n", count);
    
  return 0;
}