Re-entrant Queen's Tour

Theorem
Consider a chessboard $\CC$ of size $n \times n$ such that $n > 3$.

Then there exists a re-entrant queen's tour on $\CC$ of $2 n - 2$ moves.

For $n < 6$ it is necessary for the queen to move outside the boundary of the chessboard in order for this to happen.