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;

public class Main {
	static int primeNum(int[] arr)
	{
		int counter=arr.length;
		for(int i=0; i<arr.length; i++)
		{
			for(int j=2; j<= Math.sqrt(arr[i]); j++)
			{				
				if(arr[i]%j==0)
				{					
					counter--;
					break;
				}				
			}			
		}
		return counter;
	}
	
	public static void main(String argv[]) {
        Scanner in = new Scanner(System.in);
        int num1 = in.nextInt();
        int intArray1[];    //declaring array
        intArray1 = new int[num1];  // allocating memory to array
        
     // accessing the numbers in the second line
        for (int i = 0; i < intArray1.length; i++){
        	intArray1[i] = in.nextInt();
        }
        System.out.println(primeNum(intArray1));
        in.close();
	}
}