How many prime numbers

3
2 3 4

2

#include<iostream>
#include<math.h>

using namespace std;

bool IsPrimeNum(unsigned int val)
{
int tmp=sqrt(val);
for(int i=2;i<=tmp;i++)
{
if(val%i==0)
return false;
}
return true;
}

int main()
{
int num,result=0;
unsigned int i=0;

while(cin>>num)
{
while(num--)
{
cin>>i;
if(i==1)
continue;
else if(IsPrimeNum(i))
result++;
}
cout<<result<<endl;
result=0;
}
return 0;
}