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)

typedef struct {
    char name[100];
    int t;
} data;
   
data array[100001];
int head=0,tail=0;


int main(void){
	int N,q,i,sum=0,cnt=0;
	scanf("%d %d",&N,&q);
	for(i=0;i<N;i++){
		scanf("%s %d",array[i].name,&array[i].t);
	}
	while(cnt!=N){
		if(q<array[head].t){
			array[head].t=array[head].t-q;
			sum+=q;
			array[tail]=array[head];
			if(tail==N-1) tail=0;
			else tail++;
		}
		else if(array[head].t!=0){
			sum+=array[head].t;
			array[head].t=0;
			printf("%s %d\n",array[head].name,sum);
			cnt++;
		}
		if(head==N-1) head=0;
		else	head++;
	}
    return 0;
}