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>

void binary();

int num;
int set[100000000];
int count = 0;

int main(){
  int i;
  int j;
  int Qdata;
  int Time[500000];

  scanf("%d",&num);

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

  scanf("%d",&Qdata);

  for(i = 0;i < Qdata;i++){
    scanf("%d",&Time[i]);
    binary(Time[i]);
  }

  printf("%d\n",count);
  return 0;
}

void binary(int data){
  int left = 0;
  int right = num;

  while(left < right){
    int mid = (left + right) / 2;

    if(data == set[mid]){
      count++;
      break;
    }

    else if(data < set[mid]){
      right = mid;
    }

    else{
      left = ++mid;
    }
  }
}