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 <stdlib.h>

int compare_int(const void *a, const void *b){
	return *(int*)a - *(int*)b;
}

int main(void){
	int n;
	int q;
	scanf("%d",&n);
	int a[n];
	int i;
	for(i = 0; i < n; i++){
		scanf("%d",&a[i]);
	}
	
	scanf("%d",&q);
	int b[q];
	int j;
	for(j = 0; j < q; j++){
		scanf("%d",&b[j]);
	}
	
	qsort(b, q, sizeof(int), compare_int);
	
	int k = 0;
	int l = 0;
	int r = 0;
	while(k < n){
		if(a[k] == b[l]){
			k = k + 1;
			l = l + 1;
			r = r + 1;
		}
		else if(a[k] > b[l]){
			if(l < q){
				l = l + 1;
			}
			else if(l == q){
				break;
			}
		}
		else{
			k = k + 1;
		}
	}

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

	return 0;
	}