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.util.Scanner;

public class Main {
    public static void main(String[] args) {

        try (Scanner scanner = new Scanner(System.in)) {
            int n = Integer.parseInt(scanner.nextLine());
//            int[] s = new int[n];
//
//            for (int i = 0, p = 0; i < n; i++) {
//
//            }

            String[] s = scanner.nextLine().split(" ");

            int q = Integer.parseInt(scanner.nextLine());
            String[] t = scanner.nextLine().split(" ");

            int count = 0;

            for (String ts : t) {
                int i = Integer.parseInt(ts);
                if (search(s, i, 0, n)) {
                    count++;
                }
            }

            System.out.println(count);
        }
    }

    private static boolean search(String[] s, int i, int left, int right) {
        int half = (left + right) / 2;
        //System.out.printf("%d %d %d %d %s%n", i, left, right, half, s[half]);
        if (half == left || half == right) {
            return false;
        }
        if (i < Integer.parseInt(s[half])) {
            // if (left >= half) {
            //     return false;
            // }
            return search(s, i, left, half);
        } else if (i > Integer.parseInt(s[half])) {
            // if (right <= half) {
            //     return false;
            // }
            return search(s, i, half, right);
        }
        // 一致
        return true;
    }
}