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 Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {

		int n = sc.nextInt();
		int[] nums = inpNum(n);
		int num_prime = judgePrime(nums);
		System.out.println(num_prime);

		sc.close();
	}

	private static int judgePrime(int[] nums) {
		int num_prime = 0;
		boolean isPrime = true;

		for(int i = 0; i < nums.length; i++) {

			int sqrt = (int)Math.sqrt(nums[i]);
			isPrime = true;

				for (int j = 2; j <= sqrt ;j++) {
					if (nums[i] % j == 0) {
						isPrime = false;
						break;
					}
				}

			if (isPrime == true) {
				num_prime++;
			}

		}



		return num_prime;
	}

	private static int[] inpNum(int n) {
		int[] nums = new int[n];

		for (int i = 0; i < n; i++) {
			nums[i] = sc.nextInt();
		}
		return nums;
	}

}