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>
int main(void){
	int n,q,i,j,c=0;
	int s[100000],t[50000];
	scanf("%d",&n);//n?????\???
	
	//s?????\???
	for(i=0; i<n  ; i=i+1 ){
		scanf("%d", &s[i] );
	}
	
	scanf("%d",&q);//q?????\???
	
	//t?????\???
	for(i=0;i<q ; i=i+1){
		scanf("%d",&t[i]);
	}
	
	
	//??¢?´¢(??°?????°??????)
	//q?????°?????????
	for(i=0; i<q ; i=i+1){
		//t[i]?????¢?´¢
		for(j=0;j<n;j=j+1){
			//????????????t[i]??¨s[j]?????????????????°c????¶????
			if(t[i]==s[j]){
				c=c+1;
				break;
			}
		}
	}
	
	printf("%d\n",c);//???????????¨???

return 0;
}
//4????????????????????????1???????????°???t[0]????????????2???????????°????????????s[0]????????????s[n-1]?????§??¢?????????????????????1????????????????????????(c=c+1)??????????????????????????£??????????????????????????????
//?¬????2???????????°???????????????????§??????¢????????????3??????????????????????????°??¶????????§?¶??????????????????????????????????????????°????????¨?????????
//t[i]