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 OCaml (judge verdict: Time Limit Exceeded)

let rec range x y = if x > y then [] else x :: range (x+1) y

let isPrime n =
  if n = 2 then true
  else
    range 2 (n-1)
      |> List.map (fun x -> n mod x = 0)
      |> List.for_all (fun x -> not x)

let () =
  let counter = ref 0 in
  let n = Scanf.scanf "%d\n" (fun x -> x) in
  for i = 1 to n do
    let m = Scanf.scanf "%d\n" (fun x -> x) in
    if isPrime m then counter := !counter + 1 else ();
  done;
  Printf.printf "%d\n" !counter