Contrapositive and Contradiction · Challenge problem

Contrapositive of "if $n > 1$ is composite, then $n$ has a prime factor $p \le \sqrt n$": if $n > 1$ has no prime factor $p \le \sqrt n$, then $n$ is prime. To certify that $997$ is prime this way, how many primes must be tried?