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: Accepted)

#include<stdio.h>
#include<math.h>
int main()
{
    long int N,a=0,i,j,sum3=0,sum2=0,c=0;
    scanf("%ld",&N);
    long int num[N];
    for(i=0;i<N;i++)
    {
        scanf("%ld",&num[i]);
    }
            for(i=0;i<N;i++)
    {if(num[i]>3)
   {

       for(j=2;j<=sqrt(num[i]);j++){
    a=num[i]%j;
       if(a==0)
        c++;
       if(c>0){
          sum2=sum2+1;
          a=0;
          c=0;
          break;
}
continue;
}}
}
sum3=(N-sum2);
printf("%ld\n",sum3);
return 0;
}