Question 72
In how many ways can a chessboard $n \times n$, $n \ge 3$, from which two diagonally opposite corner cells $1 \times 1$ were cut out, accommodate $n$ rooks, neither of which attacks one other? A rook is a chess piece that attacks all the cells adjacent horizontally or vertically to the cell it is located in.