ANSWER:

We can still cover the n by n chessboard if n is odd and n>2.

First let us prove we can't cover n by n board if n is even.

If n is even n multiplied by n is also an even number. A chess board will hence contain
the same number of whites and black squares. Each domino will cover one white and
one black square.but if we take away a corner piece there will be unequal amount of
white and black square.
Total number of white squares=n/2
Total number of black squares=n/2
Total no of white square after removal=(n-1)/2
Total no of squares covered by dominoes=(n-1)/2+n/2=(2n+1)/2
Still 1 square will be left uncovered.
This will be true even if we remove a balck square.

let us prove we can't cover n by n board if n is even.

If n is odd n multiplied by n is also an odd number. A chess board will hence contain
the not same number of whites and black squares. Each domino will cover one white
and one black square.but if we take away a corner piece there will be an equal amount
of white and black square.
Total number of white squares=(n+1)/2
Total number of black squares=(n)/2
Total no of white square after removal=(n)/2
Total no of squares covered by dominoes=(n)/2+n/2=n
No square will be left uncovered.
This will be true even if we remove a balck square.

Thus we can only cover the chess board if n is odd(i.en%2!=0) and n>2