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: Runtime Error)

#include <stdio.h>

int where ( int a[], int n, int b, int c){
  int x = -1;
  for ( int i = b; i < c; ++i ){
    if ( a[i] == n ){
      x = i;
    }
  }
  return x;
}

int main()
{
 int num = 0;
 int s[10000], t[10000];
 int ns, nt, i, a;

 scanf("%d", &ns);
 for ( i = 0; i < ns; ++i ){
   scanf("%d", &s[i]);
   for ( int j = 0; j < i; ++j ){
     if ( s[i] == s[j] ){
       s[i] = -2;
     }
   }
 }

 scanf("%d", &nt);
 for ( i = 0; i < nt; ++i ){
   scanf("%d", &t[i]);
   a = where( s, t[i], t[i]-1, ns);
   if ( a < 0 ){
     a = 0;
   }
   for ( int j = a; j < ns; ++j ){
     if ( t[i] == s[j] ){
       num++;
     }
   }
 }

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

 return 0;
}