Proof Writing & Problem Solving · Easy problem

A proof by cases writes every integer as $n = 3k$, $3k + 1$ or $3k + 2$ and squares each form. How many different remainders can $n^2$ leave when divided by $3$?