The matrix is $\mathbf{A}=\bigl[a_{ij}\bigr]_{1\leqslant i,j\leqslant n}$ and is defined as follows:
$$a_{ij}= \begin{cases} i\; \mbox{if } i = j,\\ n\; \mbox{otherwise.} \end{cases} $$ or $$\mathbf{A}= \begin{bmatrix} 1 & n & \ldots & n\\ n & 2 & \ldots & n\\ \vdots & \vdots & \ddots & \vdots\\ n & n & \ldots & n\\ \end{bmatrix}$$
I tried one by one, for $n=1,2,3,$ and $4$ and I found a formula like:
$$\det(\mathbf{A})=(-1)^{n+1}\cdot n!.$$
I could not prove it by induction.
Hint: Subtract the last row from each other row, and you can get a lower triangular matrix.