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: Wrong Answer)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int n=Integer.parseInt(br.readLine());
		String[] str=br.readLine().split(" ");
		int[] S=new int[n];
		for(int i=0;i<n;i++)
			S[i]=Integer.parseInt(str[i]);
		
		int q=Integer.parseInt(br.readLine());
		str=br.readLine().split(" ");
		int[] T=new int[q];
		for(int i=0;i<q;i++)
			T[i]=Integer.parseInt(str[i]);
		
		System.out.println(method(S,T));
		

	}
	static int method(int[] s,int[] t){
		if(s.length<t.length){
			int[] tmp=s;
			s=t;
			t=tmp;
		}
		int count=0;
		for(int i=0;i<t.length;i++){
			for(int j=0;j<s.length;j++){
				{if(t[i]==s[j])count++;break;}
				
				
			}
		}
		
		return count;
	}

}