OFM 2022 J2

We consider an $n \times n$ table, with $n\ge1$ . Aya wishes to color $k$ cells of this table so that that there is a unique way to place $n$ tokens on colored squares without two tokens are not in the same row or column. What is the maximum value of $k$ for which Aya's wish is achievable?