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.*;
class Main{
    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] s = new int[n];
        for(int i = 0; i < n; i++){
            s[i] = scanner.nextInt();
        }
        Arrays.sort(s);
        int q = scanner.nextInt();
        int[] t = new int[n];
        for(int i = 0; i < q; i++){
            t[i] = scanner.nextInt();
        }

        int ans = 0;
        for(int i = 0; i < q; i++){
            int target = t[i];
            int head = 0;
            int tail = n-1;
            while(head <= tail){
                int middle = (head + tail)/2;
                //System.out.println(s[middle]);
                if(s[middle] == target){ans++;break;}
                else if(s[middle] < target){head = middle+1;}
                else{tail = middle-1;}
                
            }
        }
        System.out.println(ans);
    }
}