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)

import Control.Applicative

isPrime :: Int -> Int
isPrime n
  | n == 2         = 1
  | n `mod` 2 == 0 = 0
  | otherwise      = _isPrime 3 n
  where
        _isPrime :: Int -> Int -> Int
        _isPrime i n
          | i >  d    = 1
          | r == 0    = 0
          | otherwise = _isPrime (i+1) n
            where
                (d, r) = n `divMod` i

main :: IO ()
main = do
    n <- read <$> getLine :: IO Int
    c <- loop n
    print c
    where
        loop :: Int -> IO Int
        loop n
          | n == 0    = return 0
          | otherwise = do
              m <- read <$> getLine :: IO Int
              (+ (isPrime m)) <$> loop (n - 1)