Find the smallest number of squares on an $8\times8$ board that should be colored so that every $L$-tromino on the board contains at least one colored square.