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 MAX_N 100000
#define MAX_Q 50000

int main(){

  int i, j, key, sum, s_n, t_n, s[MAX_N], t[MAX_Q];

  scanf("%d",&s_n);
  for(i=0; i<s_n;i++){
    scanf("%d", &s[i]);
  }

  scanf("%d",&t_n);
  for(i=0; i<t_n;i++){
    scanf("%d", &t[i]);
  }

  sum = 0;
  for(i=0;i<t_n;i++){
    key = t[i];
    int left = 0;
    int right = s_n;
    while(left < right){
      int mid = (int)((left + right) / 2);
      
      if(key == s[mid]){
        sum++;
        break;
      } else if(key > s[mid]){
        left = mid + 1;
      } else {
        right = mid;
      }
    }
  }

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

  return 0;
}