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: Time Limit Exceeded)

#include <stdio.h>
#define S_MAX 100000
#define T_MAX 50000

int main(){
  int ns,nt,i,j,mid,count = 0;
  int s[S_MAX],t[T_MAX];

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

  mid = s[ns/2];

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

  j = 0;
  for(i = 0; i < nt; i++){
    if(s[j] < mid){
      for(j = 0; j < ns; j++){
        if(s[j] == t[i]){
          count++;
          break;
        }
      }
    }else{
      for(j = ns; j >= 1; j--){
        if(s[j] == t[i]){
          count++;
          break;
        }
      }
    }
  }

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

  return 0;
}