What a Proof Is · Hard problem

Let $n$ be odd, $n = 2k + 1$. Then $n^2 + 4n + 3 = 4(k + 1)(k + 2)$. What is the largest integer that divides $n^2 + 4n + 3$ for every odd $n$?