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>

void primun(int *,int *);
int main(void){

	int i,size,*num,count;
	
	scanf("%d",&size);
	num=malloc(sizeof(int)*size);
	
	for(i=0;i<size;i++)
		scanf("%d",num+i);
	primun(num,&size);

	free(num);
	return 0;
}

void primun(int *num,int *size){

	int i,j,count=0;

	for(i=0;i<*size;i++){
		if(*(num+i)==2){
			count++;
			}
		for(j=2;j<*(num+i);j++){
			if(*(num+i)%2==0)
				break;
			if(j==*(num+i)-1){
				count++;
				break;
			}
			if(*(num+i)%(j+1)==0){
				j++;
				break;
			}
		}	
	}
	printf("%d\n",count);
}