MathNet 2015-part-06 — 191 problems (EN–VI) Question 104

Let $n$ be a natural number. What is the maximum number of $1 \times 1$ squares that can be coloured black in an $n \times n$ square so that every $2 \times 2$ square contains at most 2 black small squares?