Proof Writing & Problem Solving · Easy problem

A proof that $n^3 - n$ is divisible by $3$ is organised by cases on the remainder of the integer $n$ when divided by $3$. How many cases must the write-up contain so that every integer is covered?