Question 118
Given an $8 \times 8$ chessboard. Choose one of its diagonals and call the 8 cells of this diagonal *a fence*. The Rook starts from an arbitrary square outside the fence and makes some moves so that it does not get to one square twice, and it does not stand on the squares of the fence. Find the maximal possible number of jumps over the fence on the Rook's route. (R. Zhenodarov)