For $n \ge 2$ consider $n \times n$ board and mark all $n^2$ centres of all unit squares. What is the maximal possible number of marked points that we can take such that there don't exist three taken points which form right triangle? Proposed by Mykhailo Shtandenko