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>
#include<stdlib.h>
int main(void){
  int n;
  scanf("%d",&n);
  int i,S[n];
  for(i=0; i<n; i++){
    scanf("%d",&S[i]);
  }
  int q;
  scanf("%d",&q);
  int j,T[q];
  for(j=0; j<q; j++){
    scanf("%d",&T[j]);
  }
  int same[n];
  int cnt;
  int tmp;
  cnt=0;
  for(i=cnt; i<n; i++){
    cnt=0;
    for(j=i+1; j<n; j++){
      if(S[i]==S[j]){
	same[i]=0;
	same[j]=1;
	cnt++;
	tmp=cnt;
      }else{
	same[j]=0;
	tmp=tmp+1;
	cnt=tmp;
	break;
      }
    }
  }
  int sum=0;
  for(j=0; j<q; j++){
    cnt=0;
    for(i=0; i<n; i++){
      if(same[i]==0){
	if(S[i]>T[j]){
	  break;
	}else{
	  if(S[i]==T[j]){
	    cnt=1;
	  }
	}
      }
    }
    sum+=cnt;
  }
  printf("%d\n",sum);
  return 0;
}