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.Scanner;

/**
 * Created by ??\??? on 2016/12/2.
 */
public class Main {
    static boolean[] tony(int n)
    {
        boolean[] array = new boolean[n];
        for(int i = 0;i<n;i++)
        {
            array[i] = true;
        }
        array[0] = false;
        array[1] = false;
        for(int i = 2;i<= Math.sqrt((double)n);i++)
        {
            if(array[i]) {
                int j = i + i;
                while (j < n) {
                    array[j] = false;
                    j = j + i;
                }
            }
        }
        return array;
    }
    static int run(String[] args)
    {
        boolean[] tony = tony(100000000);
        Scanner scan = new Scanner(System.in);
        while(scan.hasNext()) {
            int T = Integer.parseInt(scan.nextLine());
            int ans = 0;
            for (int i = 0; i < T; i++) {
                if (tony[scan.nextInt()])
                    ans++;
            }
            System.out.println(ans);
        }
        return 0;
    }

    public static void main(String[] args)
    {
        run(args);
    }
}