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: Time Limit Exceeded)

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int count = 0;
        int y = 0;
        for (int j = 0; j < n; j++) {
        	int z = 0;
            int x = scanner.nextInt();
            if (x == 2) {
                count += 1;
            } else if (x % 2 == 1) {
                for (int i = x - 1; i > 2; i--) {
                    y = x % i;
                    if (y == 0) {
                        z += 1;
                        break;
                    }
                }
                if (z == 0) {
                    count += 1;
                     
                }
            }
        }
        System.out.println(count);
    }
}