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 BS
{
    public Boolean BinarySearch(int b, int [] arr)
    {
        int l = 0; int r = arr.length; Boolean hasItem = false;
        while(l<r)
        {
            int mid = (l+r)/2;
            int key = arr[mid];
            if(key==b)
            {
                hasItem=true;
                break;
            }
            else if(b<key) r = mid;
            else l = mid+1;
        }
        return hasItem;
    }
}
class Main
{
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int a [] = new int[n];
        for(int i = 0; i<n; i++) a[i] = sc.nextInt();
        int q = sc.nextInt();
        BS bs = new BS();
        int cnt = 0;
        for(int i = 0; i<q; i++) 
        {
            if(bs.BinarySearch(sc.nextInt(),a))
            {
                cnt++;
            }
        }
        System.out.println(cnt);
    }
}