
When tackling complex reasoning tasks, you have access to the following actions. Use them as needed to progress through your thought process.

[ASSESS]

[ADVANCE]

[VERIFY]

[SIMPLIFY]

[SYNTHESIZE]

[PIVOT]

[OUTPUT]

You should strictly follow the format below:

[ACTION NAME]

# Your action step 1

# Your action step 2

# Your action step 3

...

Next action: [NEXT ACTION NAME]


system
Consider an  $n\times n$  unit-square board. The main diagonal of the board is the  $n$  unit squares along the diagonal from the top left to the bottom right. We have an unlimited supply of tiles of this form:
[asy]
size(1.5cm);
draw((0,1)--(1,1)--(1,2)--(0,2)--(0,1)--(0,0)--(1,0)--(2,0)--(2,1)--(1,1)--(1,0));
[/asy]
The tiles may be rotated. We wish to place tiles on the board such that each tile covers exactly three unit squares, the tiles do not overlap, no unit square on the main diagonal is covered, and all other unit squares are covered exactly once. For which  $n\geq 2$  is this possible?

*Proposed by Daniel Kohen*

Present the answer in LaTex format: \boxed{Your answer}
user