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 int_cmp(const int *a, const int *b)
{
	if (*a > *b)
		return 1;
	else if (*a < *b)
		return -1;
	else
		return 0;
}


int main(void)
{
	int n, q, c;
	int S[100000], T[50000];
	int 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]);

	qsort(T, q, sizeof(int), (int (*)(const void *, const void *))int_cmp);

	c = 0;
	j = 0;
	for (i = 0; i < q; i++){
		while (T[i] > S[j] && j < n-1)
			j++;
		if (T[i] == S[j])
			c++;
	}
	printf("%d\n", c);

	return 0;
}