A floor with dimensions $11 \times 11$ will be covered by some tiles with dimensions $1 \times 1, 2 \times 2,$ or $3 \times 3$ without overlapping. Find the least possible number of $1 \times 1$ tiles that will be needed.

Your answer seems reasonable.
Find out if you're right!