RIOPLATENSE 2015 Problem 3

We say an integer number $n \ge 1$ is conservative, if the smallest prime divisor of $(n!)^n+1$ is at most $n+2015$ . Decide if the number of conservative numbers is infinite or not.