Question 90
Let $n \ge 3$ be a positive integer. We wish to inscribe into each square of the $n \times n$ array one of the numbers $1$, $2$ or $3$, so that any three squares which can be covered using the following shape [ ] [ ] [ ] (which can also be rotated) will contain three different numbers. In how many different ways can this be done?