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.io.*;
import java.util.*;

//height 違う
public class Main{
    static int count =0;
    public static void main(String[] args)throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String str;
        str = br.readLine();
        
        int N = Integer.parseInt(str);

        int ans = 0;
        //int[] num = new int[N];
        for(int i=0;i<N;i++){
            str = br.readLine();
            //num[i] = Integer.parseInt(str);
            if(run(Integer.parseInt(str)) == 2){
                ans ++;
            }
        }

        System.out.println(ans);

    }
    public static int run(int a){
        if(a == 0){
            return 100;
        }
        int count = 0;
        for(int i=1;i<=a;i++){
            if(a % i ==0){
                count ++;
            }
        }
        return count;
    }
}