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;
using System.Linq;
using System.Text;

namespace ConsoleApplication2
{
    class Program
    {
        static void Main(string[] args)
        {
            string input=Console.ReadLine();
            int n = int.Parse(input);
            int[] b = new int[n];
            int count;
            count=0;

            for (int i = 0; i < n; i++)
            {
                string a = Console.ReadLine();
                b[i] = int.Parse(a);
            }

            int[] d = new int[b.Max()+1];
            int c = (int)Math.Sqrt(b.Max());

            for (int i = 2; i <= c; i++)
            {
                if (d[i] == 0)
                {
                    for (int j = 2; i * j < b.Max(); j++)
                    {
                        d[i * j] = 1;
                    }
                }
            }

            for (int i = 0; i < n; i++)
            {
                if (d[b[i]] == 0)
                {
                    count = count + 1;
                }
            }

            Console.WriteLine(count);
            Console.ReadLine();
        }
    }
}