Question 89
Let $n \geq 4$ be a positive integer. On the chessboard table with dimensions $n \times n$ we put coins. We consider the diagonals of the table, each diagonal with at least two unit squares. What is the smallest number of coins to put on the table so that on each horizontal, each vertical, and each diagonal there exists at least one coin? Prove the answer.