What a Proof Is · Hard problem

Claim: "if $n$ is odd, then $n^2 + 4$ is prime." It works for $n = 1, 3, 5, 7$. What is the smallest positive odd $n$ for which it fails?