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: Accepted)

import java.util.*;

public class Main {
	
	public static void main(String[] args) {
		
		
		Scanner scan = new Scanner(System.in);
		int[] array1 = new int[scan.nextInt()];
		for(int i=0; i<array1.length; i++) {
			array1[i]=scan.nextInt();
		}
		int[] array2 = new int[scan.nextInt()];
		for(int i=0; i<array2.length; i++) {
			array2[i]=scan.nextInt();
		}
		
		int output = 0;
		HashMap<Integer, Integer> a1Map = new HashMap<Integer, Integer>();
		for(int i = 0; i<array1.length; i++) {
			a1Map.put(array1[i],0);
		}
		
		for(int i = 0; i<array2.length; i++) {
			if(a1Map.containsKey(array2[i])) {
				if(a1Map.get(array2[i])==0) {
					a1Map.replace(array2[i],0);
					output++;
				}
			}
		}
		System.out.println(output);
		
		
	}
}