From an $n\times n$ square divided into $n^2$ unit squares, one corner unit square is cut off. Find all positive integers $n$ for which it is possible to tile the remaining part of the square with $L$-trominos.
Problem
Source: 1998 Estonia National Olympiad Final Round grade 12 p5
Tags: combinatorics, combinatorial geometry, square
