Induction · Medium problem

Every integer $n \ge 20$ is a sum of $5$s and $6$s. A strong-induction proof uses $P(k - 5)$ to get $P(k + 1)$ (add a $6$ to a representation of $k - 5$). How many base cases must be checked by hand?