Consider a chess board of size \(n \times n\). It is required to move a rook from the bottom left corner to the upper right corner. You can move only up and to the right, without going into the cells of the main diagonal and the one below it. (The rook is on the main diagonal only initially and in the final moment in time.) How many possible routes does the rook have?