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 JAVA (judge verdict: Runtime Error)

import java.util.Scanner;


 class Main{

	public static boolean search(int A[],int n,int key){
		 A[n]=key;  //???????????¨???????????¢??¢?´¢.
		 int i = 0;
		 while(A[i] != key) 
			 i++;
		return i!= n;
	}
	public static void main(String[] args) {
		int A[]=new int[10000];
		int i,j,n,q,key,sum=0;
		
		Scanner s =new Scanner(System.in);
		n=s.nextInt();
		for(i=0;i<n;i++){
			A[i]=s.nextInt();
		}
		
		q=s.nextInt();
		for(j=0;j<q;j++){
			key=s.nextInt();
			if(search(A,n,key))
                          sum++;
		}
	  System.out.println(sum);
	}

}