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 C# (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
class Program
{
    static void Main()
    {
        int n = int.Parse(Console.ReadLine());
        int[] nArray = new int[n];
        int i = 0;
        int j = 0;
        for (i = 0; i < n; i++)
        {
            nArray[i] = int.Parse(Console.ReadLine());
        }

        List<int> prime = new List<int>();
        int current = 0;
        for (current = 1000; current > 1; current--)
        {
            for(i = current; i > 1; i--)
            {
                if ((current % i == 0 || current % 2 == 0) && current != 2 && current != i)
                    break;
                else if (i == 2 && current % i != 0)
                    prime.Add(current);
                else if (current == 2 && i == 2)
                    prime.Add(current);
            }   
        }

        int count = 0;
        for(i = 0;i < nArray.Length; i++)
        {
            for(j = 0;j < prime.Count; j++)
            {
                if (nArray[i] == prime[j])
                    count++;
            }
        }

        Console.WriteLine(count);
        
    }
}