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>
#include <math.h>
#define S_MAX 100000
#define T_MAX 50000
#define FALSE 0

int S[S_MAX] = {0};
int T[T_MAX] = {0};
int n,cnt = 0;
double d_cnt = 0;

void Search(double d, int i){
	if(pow( 2.0, d_cnt) <= n){
		d_cnt++;
		int divide = d * (double)n;
		if(S[divide] < T[i]){
			d = d + pow( 1.0 / 2.0, d_cnt + 1);
			Search(d, i);
		}else if(S[divide] > T[i]){
			d = d - pow( 1.0 / 2.0, d_cnt + 1);
			Search(d, i);
		}else{
			cnt++;
		}
	}
}

int main(void){
	int q,i,j;

	scanf("%d", &n);

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

	scanf("%d", &q);

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

	for(i = 0;i < q;i++){
		d_cnt = 0;
		Search(1.0 / 2.0, i);
	}

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

	return 0;
}