On a board 12 × 12 are placed some knights in such a way that in each 2 × 2 square there is at least one knight. Find the maximum number of squares that are not attacked by knights. (A knight does not attack the square in which it is located.)