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>
#define MAX 100000
int main(){
	int n1,n2,cnt=0,i=0,j=0;
	int s[MAX],key;
	int right,left,mid;
	
	
	scanf("%d",&n1);
	
	for(i=0;i<n1;i++){
		scanf("%d",&s[i]);
	}
	
	scanf("%d", &n2);
	

	for(j=0;j<n2;j++){
		scanf("%d",&key);
		left = 1;
		right = n1;
		while(left < right){
			mid = (left+right)/2;
			//printf("left:%d\nmiddle:%d\nright:%d\n\ncnt:%d\n",left,mid,right,cnt);
			if( s[mid] > key ) right = mid;
			
			else if( s[mid] < key ) left = mid + 1;
			
			else if(s[mid]==key){
				cnt++;
				break;
			}
		}
	}
	printf("%d\n",cnt);
	return 0;
}