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

import java.util.*;
class Main {
    public static void main(String...args) {
        Scanner scan = new Scanner(System.in);
        int count = 0;
        boolean isPrime;
        while(scan.hasNext() ) {
           isPrime = true;
           int primeNum = scan.nextInt();
           
           switch(primeNum) {
               case 1 :
                          isPrime = true;
               break;
                case 2 :
                          isPrime = true;
               break;
               default:
               if(primeNum % 2 == 0){
                   isPrime = false;
               } else {
                   int rootNum = (int)Math.sqrt(primeNum);
                   boolean flag = true;
                   while(flag && rootNum > 1) {
                       isPrime = true;
                       if(primeNum % rootNum== 0){
                           isPrime = false;
                           flag = false;
                        }else{
                            rootNum--;
                        }
                    }
               }
            }
            if(isPrime) {
                count++;
            }
        }
        System.out.println(count);
    }
}