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.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		// BufferedReader br = new BufferedReader(new FileReader("in1.txt"));
		// BufferedReader br = new BufferedReader(new FileReader("in2.txt"));
		int n = Integer.parseInt(br.readLine());
		List<Integer> S = new ArrayList<Integer>();
		String[] line_S = br.readLine().split(" ");
		for (String str : line_S)
			S.add(Integer.parseInt(str));
		int q = Integer.parseInt(br.readLine());
		List<Integer> T = new ArrayList<Integer>();
		String[] line_T = br.readLine().split(" ");
		for (String str : line_T)
			T.add(Integer.parseInt(str));
		
		int C = 0;
		Collections.sort(S);
		for (int t : T)
			if (Collections.binarySearch(S, t) >= 0)
				C++;
		
		System.out.println(C);
	}
}