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

object Main extends App{
    // Your code here!
    import scala.math.sqrt
    import scala.io.Source.stdin
    def is_prime(x: Int): Boolean = {
        x match {
            case 1 => return false
            case 2 | 3 => return true
            case _ => false
        }
        val last: Int = math.sqrt(x).toInt
        for(i <- 2 to last) {
            x%i match {
                case 0 => return false
                case _ => true
            }
        }
        true
    }
    def prime_num(nums: Int*): Int = {
        nums.filter(is_prime).length
    }
    val input = {for(line <- io.Source.stdin.getLines()) yield {
        line.toInt
    }}.toSeq
    val inputSeq = input.tail
    println(prime_num(inputSeq: _*))
}