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>

int binary_search(int key);

int matrix_main[100000];
int matrix_sub[50000];

int main_count = 0;
int sub_count = 0;

int binary_search(int key){
  int left = 0,right = main_count;
  int mid;

  while(right-left>1){
    mid = (left+right)/2;
    if(key<matrix_main[mid])right=mid;
    else left=mid;
  }

  return matrix_main[left]==key;
}


int main(){

  int i=0,key;
  int count = 0;

  scanf("%d",&main_count);
  for(i = 0 ; i < main_count ; i++)
    scanf("%d",&matrix_main[i]);


  scanf("%d",&sub_count);
  for(i = 0 ; i < sub_count ; i++){
    scanf("%d",&key);
    if(binary_search(key)) count++;
  }
  printf("%d\n",count);
  return 0;

}