For every $\displaystyle n\geq 2$, determine the greatest number of rooks that can be placed on a $\displaystyle n\times n$ checkerboard so that the following property is satisfied: if a rook is attacked by two others, then all three are on the same line.