Challenges-Arrays- Prime Visits

the sample input and output don’t match according to question. If the question is correct then what’s wrong with my code?(Please do corrections)

you are not considering the fact that 1 and the number itself is also a divisor of that number…consider 15-1,3,5,15 are its divisors…consider 7 it has 1 and 7 as its divisors…so you need to return the count of those elements which have 2 divisors…