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 main()
{
	int i,p,b,count=0,j;
	
	scanf("%d", &p);
	int *binary = (int*)malloc(sizeof(int)*p);

	for (i = 0; i < p; i++)
	{
		scanf("%d", &binary[i]);
	}

    scanf("%d", &b);
	int *binary2 = (int*)malloc(sizeof(int)*b);

	for (i = 0; i < b; i++)
	{
		scanf("%d", &binary2[i]);
	}

	


	for (i = 0; i < b; i++)
	{
		int left = 0, right = p;
		
				while(left <= right){
					j = (left + right) / 2;
					if(binary2[i] == binary[j])
					{
						count++;
					    break;
						
					}
					else if(binary2[i] > binary[j])
					right = j ;
					else if(binary2[i] < binary[j])
					left = j + 1;
				}
	
	}

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


	return 0;
}