Proof Writing & Problem Solving · Superchallenge problem

For how many integers $n$ with $1 \le n \le 50$ can a square be cut into exactly $n$ squares? (The pieces may have different sizes; $n = 1$ counts, using the square itself.)