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 Ruby (judge verdict: Wrong Answer)

def count_prime(array)
  count = 0
  array.each do |value|
    is_break = false
    next if value < 2
    if value == 2
      count += 1
      next
    end
    (2..value-1).each do |i|
      if (value % i).zero?
        is_break = true
        break
      end
    end
    next if is_break
    count += 1
    p value
  end
  count
end

array = []
n = gets.to_i
n.times {array << gets.to_i}

puts count_prime array