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 n 10000
#define q 5000

int main(){
  
  //ARRAY
  int S[n];
  int T[q];
  int U[q];

  //ARRAY_NUMBER
  int sNum,tNum;

  //ROOP_NUMBER
  int i,j,k;

  //ELEMENT_COUNETR
  int c = 0;

  //BINARY_NUMBER
  int tail,head,mid;

  //ARRAY_S_SCAN
  scanf("%d",&sNum);

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

  //ARRAY_T_SCAN
  scanf("%d",&tNum);

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


  for(i = 0; i < tNum; i++){

    tail = sNum;
    head = 0;

    while(tail > head){

      //printf("\ttail:%d head:%d c:%d\n",tail,head,c);

      mid = (head + tail) / 2;

      if(T[i] > S[mid]){
	head = mid;

      }else if(T[i] < S[mid]){
	tail = mid;

      }
      else{
	for(k = 0; k < n; k++){
	  if(U[k] == T[i])break;
	  else{
	    U[c] = T[i];
	    c++;
	    break;
	  }
	}
	break;
      }
    }
  }

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

  return 0;
}