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

{-# OPTIONS_GHC -O2 #-}
import Data.List
toInt::String->Int
toInt = read
isPrime::Int->Bool
isPrime 1 = False
isPrime 2 = True
isPrime 3 = True
isPrime n = foldr (\x y->mod n x /= 0 && y) True (2:[3,5..m])
  where
    m = ((\x->if odd x then x else x-1).floor.sqrt.fromIntegral) n
primeNum::[] Int->Int
primeNum [] = 0
primeNum (x:xs) = (if isPrime x then 1 else 0) + primeNum xs
main = do
  getLine
  getContents >>=
    print.primeNum.(map toInt).lines