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 sort(void *a, void *b) {
	return *(int *)a - *(int *)b;
}

int main(void) {
	int n, q;
	int v, c = 0;
	int S[100000];
	int i;
	
	scanf("%d", &n);
	
	for (i = 0; i < n; ++i) {
		scanf("%d", &v);
		S[i] = v;
	}
	
	qsort(S, n, sizeof(S[0]), sort);
	
	scanf("%d", &q);
	
	++q;
	while (--q) {
		scanf("%d", &v);
		for (i = 0; i < n; ++i) {
			if (S[i] == v) {
				++c;
				break;
			} else if (S[i] > v) {
				break;
			}
		}
	}
	
	printf("%d\n", c);
	
	return 0;	
}