## Minimum number of distinct integers on a n x n chessboard

In an $n\times n$ chessboard, every square contains an integer. If every column and row has at least $k$ distinct integers, where $0, find the minimum number of distinct integers in the chessboard.

Thank you.