# Possible Magicked Square

What is the smallest integer $$n \geq 2$$ such that the following statement is true?

There exists a $$n \times n$$ grid such that each square contains the number $$1, 2, \ldots, n$$ such that no row, column or main diagonal contains the same number more than once.

×