Question 106
The unit squares of a $n \times n$ board, $n \ge 2$, are colored either black or white so that any black square has at least three white neighbors (a neighbor is a unit square with a common side). What is the maximum number of black unit squares?