KöMaL 2025 C1881

Given an $n\times n$ chessboard, we want to cover it without overlaps using L-shaped pieces consisting of 3 squares, in such a way that at most one square remains uncovered. Prove that this is possible for any positive integer $n\neq 3$. (All the sides of the L-shape should follow the grid lines.)