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::*;
use std::str::FromStr;

fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

fn binary_search(array: Vec<u32>, key: u32) -> usize {
    let len: usize = array.len();
    let mut left: usize = 0;
    let mut right: usize = len;
    while left < right {
        let mid: usize = (left + right) / 2;
        if array[mid] == key {
            return mid;
        } else if key < array[mid] {
            right = mid;
        } else {
            left = mid + 1;
        }
    }
    return len;
}

fn main() {
    let n: usize = read();
    let s: Vec<u32> = (0..n)
        .map(|_| {
            let number: u32 = read();
            number
        })
        .collect();
    let q: usize = read();
    let t: Vec<u32> = (0..q)
        .map(|_| {
            let number: u32 = read();
            number
        })
        .collect();
    let mut count: u32 = 0;
    let s_len: usize = s.len();
    for key in t {
        if s_len != binary_search(s.clone(), key) {
            count += 1;
        }
    }
    println!("{}", count);
}