HDU 2138 How many prime numbers

#include<iostream>
#include<stdio.h>
#include<cmath>
using namespace std;
int prime(int n)
{
if(n==2||n==3)
return 1;
int i;
for(i=2;i<=sqrt((double)n);i++)
{
if(n%i==0)
return 0;
}
return 1;

}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int i;
int sum=0;
int temp;
for(i=0;i<n;i++)
{
scanf("%d",&temp);
if(prime(temp)==1)
sum++;
}
printf("%d\n",sum);
}

return 0;
}