We call a rook ${NeX}$ if the rook can't go more than $60$ steps(up, down, right and left). Consider a $100\times 100$ chessboard. Find the maximum number of ${NeX}$ rooks, such that no rook can beat the other.