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 main() {
	int i, temp, answer, first_array_size, second_array_size;
	scanf("%d", &first_array_size);

	int* first_array = (int*)malloc(sizeof(int) * first_array_size);
	for (i = 0; i != first_array_size; i++) {
		scanf("%d", &first_array[i]);
	}

	answer = 0;
	scanf("%d", &second_array_size);

	int minimum, maximum, middle;
	while (second_array_size--) {
		scanf("%d", &temp);

		minimum = 0;
		maximum = first_array_size - 1;

		while (minimum <= maximum) {
			middle = (minimum + maximum) / 2;

			if (first_array[middle] == temp) {
				answer++;
				break;
			}

			else if (first_array[middle] > temp) {
				maximum = middle - 1;
			}

			else if (first_array[middle] < temp) {
				minimum = middle + 1;
			}
		}
	}

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

	free(first_array);
}