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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.charset.StandardCharsets;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);
		String s = in.readLine();
		int n = Integer.parseInt(s);
		s = in.readLine();
		int[] a = new int[n];
		String[] as = s.split(" ");
		for(int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(as[i]);
		}
		s = in.readLine();
		int q = Integer.parseInt(s);
		int[] t = new int[q];
		s = in.readLine();
		as = s.split(" ");
		for(int i = 0; i < q; i++) {
			t[i] = Integer.parseInt(as[i]);
		}
		int count = 0;
		for(int i = 0; i < q; i++) {
			int left = 0;
			int right = n-1;
			int mid = (left + right) / 2;
			while (left <= right) {

				if(a[mid] == t[i]) {
					count++;
					break;
				} else if(a[mid] < t[i]) {
					 left = mid+1;
					 mid = (left + right) / 2;
				} else if(a[mid] > t[i]) {
					right = mid-1;
					mid = (left + right) / 2;
				}
			}
		}
		System.out.println(count);
	}
	
	
}