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: Wrong Answer)


import scala.collection.mutable.ListBuffer
import scala.io.StdIn

object Main extends App {

  val n = StdIn.readLine().trim.toInt
  val lst: Array[Int] = (0 until n).map{ _ =>
    StdIn.readLine().trim.toInt
  }.sorted.toArray

  var lsize = lst.size

  var evl = lst.head
  var max = lst.last
  var buff = ListBuffer.empty[Int]
  var idx = 0
  while(evl < scala.math.sqrt(max)){
    buff += evl 
    (0 until lsize).foreach{ i =>
      val tmp = lst(i)
      lst(i) = if(tmp % evl == 0) 0 else tmp
    }
    idx += 1
    evl = lst(idx)
    while(idx < lsize && evl == 0){
      idx += 1
      evl = lst(idx)
    }
  }
  (idx until lsize).foreach { i =>
    val tmp = lst(i)
    if(tmp != 0) buff += tmp 
  }

  println(buff.size)
  
}