Problem:
Prime Numbers

A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.

Write a program which reads a list of N integers and prints the number of prime numbers in the list.

Input

The first line contains an integer N, the number of elements in the list.

N numbers are given in the following lines.

Output

Print the number of prime numbers in the given list.

Constraints

1 ≤ N ≤ 10000

2 ≤ an element of the list ≤ 108

Sample Input 1

5
2
3
4
5
6

Sample Output 1

3

Sample Input 2

11
7
8
9
10
11
12
13
14
15
16
17

Sample Output 2

4

Solution in Rust (judge verdict: Accepted)

fn main() {
    let n: usize = read();
    let result: u16 = (0..n).fold(0u16, |mut sum, _| {
        let e: u32 = read();
        if is_prime(e) {
            sum += 1;
        }
        sum
    });
    println!("{}", result);
}

fn is_prime(e: u32) -> bool {
    if e == 2 {
        return true;
    }
    if e == 0 || e == 1 || e % 2 == 0 {
        return false;
    }
    let root: u32 = (e as f64).sqrt().ceil() as u32;
    let mut i = 3;
    while i <= root {
        if e % i == 0 {
            return false;
        }
        i += 2;
    }
    true
}

fn read<T: std::str::FromStr>() -> T {
    let mut input = String::new();
    std::io::stdin().read_line(&mut input).unwrap();
    input.trim().parse::<T>().ok().unwrap()
}