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.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main{
//	private int LinearSearch(int[] a1, int[] a2) {
//		
//	}
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		Set<Integer> set1 = new HashSet<>();
		for (int i = 0; i < n; ++i) 
			set1.add(scan.nextInt());
		int q = scan.nextInt();
		Set<Integer> set2 = new HashSet<>();
		for (int i = 0; i < q; ++i) 
			set2.add(scan.nextInt());
//		set1.retainAll(set2);//求共同元素
//		//返回值表示set1的内存发生改变，s两者可能没有公共元素，set1变成空集
//		System.out.println(set1.size());
		int sum = 0;
		for(int i : set1)
			for (int j : set2) {
				if(i == j)
					sum++;
			}
		System.out.println(sum);
				
	}

}