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: Memory Limit Exceeded)

#include <stdio.h>          // printf(), scanf()
#include <stdlib.h>         // malloc(), free()
#include <string.h>         // memset()
#include <stdbool.h>

#define MAX_N 1000000000

int
main(int argc, char** argv)
{
	int n = 0;
	int q = 0;
	int t = 0;
	int i, j;
	bool* s = malloc(MAX_N);
	memset(s, 0x00, MAX_N);

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

	scanf("%d", &q);
	int count = 0;
	for (i = 0; i < q; ++i)
	{
		scanf("%d", &t);
		if (s[t])
			count++;
	}

	printf("%d\n", count);
	free(s);
	return 0;
}