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

var input = require('fs').readFileSync('/dev/stdin', 'utf8');

var Arr=(input.trim()).split("\n").map(Number);
Arr.shift();
Arr=Arr.filter(function(v){return (v%2!=0);});
Arr.sort(function(a,b){return a-b;});
var max=Arr[Arr.length-1];
var arr=[2];

for(var i=3;i<=max;i=i+2){
   var a=true;
   var sqrt=~~(Math.sqrt(i))+1;
   for(var j=0;j<arr.length;j++){
      if(arr[j]>sqrt)break;
      if(i%arr[j]==0){
         a=false;
         break;
      }
   }
   if(a)arr.push(i);
}

var num=0;
var f=0;

for(var i=0;i<Arr.length;i++){
   var index=arr.indexOf(Arr[i],f);
   if(index!=-1){
      f=index;
      num++;
   }
}
console.log(num);