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.*;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.stream.IntStream;
//import java.io.*;
//import java.util.stream.IntStream;

public class Main {
    static int minR = Integer.MAX_VALUE;
    static int maxL = 0;

    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        // BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        // try{
        // int n = Integer.parseInt(br.readLine());
        int n = Integer.parseInt(sc.nextLine());
        int[] T = Arrays.stream(sc.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
        int q = Integer.parseInt(sc.nextLine());
        int[] S = Arrays.stream(sc.nextLine().split(" ")).mapToInt((s) -> Integer.parseInt(s)).toArray();
        
        AtomicInteger count = new AtomicInteger();

        Arrays.stream(S)
            .forEach((elm)->{
                boolean flag = binarySearch(elm, T, 0, T.length);
                        if (flag) {
                            count.getAndIncrement();
                        }
                    });
        
        System.out.println(count);

        }

        public static boolean binarySearch(int elm, int[] T, int l, int r) {
        int m = (l + r) / 2;
        if(elm == T[m]){
            return true;
        }
        if(m == l){
            return false;
        }
        if(elm < T[m]){
            return binarySearch(elm, T, l, m);
        }else{
            return binarySearch(elm, T, m, r);
        }
    }
}