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>
#define N 10000

main(){
  int pnumber[N];/*prime number*/
  int number=0;/*natural number*/
  int i,j;
  int count=0;
  int pcount=0;/*prime number count*/
  
  /*読み込む整数の個数*/
  scanf("%d",&number);
  
  for(i=0; i<number; i++){
    /*pnumber個整数を格納し、剰余算の答えが０になるものを数える*/
    scanf("%d",&pnumber[i]);
    for(j=1; j<=pnumber[i]; j++){
      if(pnumber[i]%j == 0){
	count++;
      } 
    }
    /*prime number count*/
    if(count == 2){
      pcount++;
      count=0;
    }
    else count=0;
  }
  printf("%d\n",pcount);
  return 0;
}