Problem:
Search I

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

n ≤ 10000

q ≤ 500

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
3 1 2
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 LinearSearch(int A[],int n,int k){
	int i=0;
	A[n]=k;
	while(A[k]!=n){
		i++;
	}
	
	if(i==n){
		return 0;
	}else{
		return 1;
	}
}

int main(){
	int n,q,k;
	int A[10000];
	int i;
	int a,s;
	
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&A[i]);
	}
	
	scanf("%d",&q);
    s=0;
	for(i=0;i<q;i++){
		scanf("%d",&k);
		a=LinearSearch(A,n,k);
		if(a==1){
			s++;
		}
	}
	
	printf("%d\n",s);
	return 0;
}