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.io.InputStreamReader;
import java.io.BufferedReader;

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[] S = new int[n+1];
        int[] T = new int[q];
        
        for (int i = 0; i < n; i++) {
            S[i] = Integer.parseInt(s[i]);
        }
        
        for (int i = 0; i < q; i++) {
            T[i] = Integer.parseInt(t[i]);
        }
        
        int left = 0;
        int right = n;
        int mid = (left + right) / 2;
        //System.out.println(x);
        int count = 0;
        for (int i = 0; i < q; i++) {
            mid = n/2;
            left = 0;
            right = n;
            while (left < right) {
                //System.out.println("S: " + S[mid] + " T: " + T[i]);
                if (S[mid] == T[i]) {
                    count++;
                    break;
                }
                if (S[mid] < T[i]) {
                    //if (left == mid) break;
                    left = mid+1;
                    mid = (left + right) / 2;
                }
                else {
                    //if (left == mid) break;
                    right = mid;
                    mid = (left + right) / 2;
                }
                
            }
        }
        
        

        System.out.println(count);
    }
}