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;
import java.util.stream.IntStream;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        int[] s = scanInt(scanner, n);

        int q = scanner.nextInt();
        int[] t = scanInt(scanner, q);

        System.out.println(IntStream.of(t).map(i -> binarySearch(s, i)).sum());
    }

    private static int binarySearch(int[] s, int key) {
        int left = 0;
        int right = s.length;
        while (left < right) {
            int mid = (left + right) / 2;
            if (s[mid] == key) {
                return 1;
            } else if (s[mid] > key) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return 0;
    }

    private static int[] scanInt(Scanner scanner, int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++) a[i] = scanner.nextInt();
        return a;
    }
}