Question 155
Let's call the filling of the square $2009 \times 2009$ which is divided into unit squares "correct" if it is filled with numbers $1,2,\ldots,2009$ in such a way that each of these numbers appears in every row and every column. Let's consider the distance from the central square to the nearest square with number «1» (by the distance we mean the least number of moves of the king to get to the square). What is the maximum value the distance can have?