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>

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

int main(void) {
    	int i,j,k,n,q,t;
	int S[100000];
	int T[50000];
	int R[500];
	
	scanf("%d\n", &n);
	for(i=0;i<n;i++) {
		scanf("%d", &S[i]);
	}

	scanf("%d\n", &q);
	for(i=0;i<q;i++) {
		scanf("%d", &T[i]);
	}
	
	qsort((void*)S, n, sizeof(S[0]), sort);
	qsort((void*)T, q, sizeof(T[0]), sort);
	
	i=j=k=0;
	while(i<n&&j<q) {
		if(S[i] == T[j]) {
			R[k] = S[i];
			i++;j++;k++;
		} else if(S[i] > T[j]) {
			j++;
		} else if(S[i] < T[j]) {
			i++;
		}
	}
	printf("%d\n", k);

	return 0;
}