Proof Writing & Problem Solving · Easy problem

A proof by strong induction shows a statement $P(n)$ for all $n \ge 1$. The inductive step proves $P(n)$ from $P(n-1)$ and $P(n-2)$, and it is valid for every $n \ge 3$. How many base cases must the write-up check?