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 S1[1000000],f;

int binary_s(int z){
  int lef_s=0,rig_s=f;
  int o;
  while(lef_s<rig_s){
    o=(lef_s+rig_s)/2;
    if(z==S1[o]) return 1;
    if(z>S1[o]) lef_s=o+1;
    else if(z<S1[o]) rig_s=o;
  }
  return 0;
}

int main(){
  int i,g,z,match=0;
  
  scanf("%d",&f);
  for(i=0;i<f;i++){
    scanf("%d",&S1[i]);
      }
  
  scanf("%d",&g);
  for(i=0;i<g;i++){
    scanf("%d",&z);
    if(binary_s(z)) match++;
  }

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

    return 0;
}