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: Time Limit Exceeded)

#include<stdio.h>
#include<stdlib.h>
int main(){
  int i=0;
  int j,k,a;
  int count=0;
  int n[10000];
  scanf("%d",&a);
  if(a<1 || a>10000){
    exit(1);
  }
  for(i=0;i<a;i++){
    scanf("%d",&n[i]);
    if(n[i]<2 || n[i]>100000000){
      exit(1);
    }
  }
  for(i=0;i<a;i++){
    k=0;
    for(j=1;j<=100000000;j++){
      if(n[i]%j==0){
	k++;
      }
    }
    if(k==2){
      count++;
    }
  }
  printf("%d\n",count);
  return 0;
}