Problem:
Search II

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

Elements in S is sorted in ascending order

n ≤ 100000

q ≤ 50000

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
1 2 3
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.*;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(
			new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		String S[] = br.readLine().split(" ");
		int q = Integer.parseInt(br.readLine());
		String T[] = br.readLine().split(" ");
		int count = 0;
		for (int i = 0; i < q; i++) {
			if (binarysarch(S, T[i]) != -1) count++;
		}
		System.out.println(count);
	}
	public static int binarysarch(String[] S, String x) {
		int lx = 0, rx = S.length - 1;
		while (lx <= rx) {
			int c = (lx + rx) / 2;
			if (Integer.parseInt(S[c]) == Integer.parseInt(x)) {
				return c;
			} else if (Integer.parseInt(S[c]) < Integer.parseInt(x)) {
				lx = c + 1;
			} else {
				rx = c - 1;
			}
		}
		return -1;
	}
}