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;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
            int count = 0;

            var n = int.Parse(Console.ReadLine());

            var data = new int[n];

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

            for (int i = 0; i < n; i++)
            {
                for (int j = 2; j <= (int)Math.Sqrt(data[i])+1; j++)
                {
                    if (data[i] % j == 0)
                    {
                        break;
                    }

                    if (data[i] % ((int)Math.Sqrt(data[i])+1) != 0 && j == (int)Math.Sqrt(data[i])+1)
                    {
                        count++;
                    }

                }
                
            }

            Console.WriteLine(count);
            Console.WriteLine((int)Math.Sqrt(31));
                     
        }
    }
}