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 Rust (judge verdict: Accepted)

use std::io::Read;

fn main() {
    let mut buf = String::new();
    std::io::stdin().read_to_string(&mut buf).unwrap();

    let answer = solve(&buf);

    println!("{}", answer);
}

fn solve(input: &str) -> String {
    let mut iterator = input.split_whitespace();

    let n: usize = iterator.next().unwrap().parse().unwrap();

    let mut s: Vec<isize> = Vec::with_capacity(n);
    for _i in 0..n {
        s.push(iterator.next().unwrap().parse().unwrap());
    }

    let mut ans: usize = 0;

    let q: usize = iterator.next().unwrap().parse().unwrap();
    for _i in 0..q {
        let t: isize = iterator.next().unwrap().parse().unwrap();

        if binary_search(&s, t) {
            ans += 1;
        }
    }

    return ans.to_string();
}

fn binary_search(s: &Vec<isize>, t: isize) -> bool {
    let mut l = 0;
    let mut r = s.len();

    while l < r {
        let i = (l + r) / 2;

        if s[i] == t {
            return true;
        } else if s[i] < t {
            l = i + 1;
        } else {
            r = i;
        }
    }

    false
}