Question 176
Define the *distance* between two cells of a checkered board as the smallest number of chess king's moves needed to come from one cell to the other. Determine the largest $n$ for which one can mark $n$ cells of a $100 \times 100$ board so that none of the distances between two marked cells equals $15$.