Question 3
Consider a square board of size $n\times n$, where $n$ is a fixed even positive integer. The board is divided into $n^2$ unit squares. Two different squares are adjacent if they have a common side. A total of $N$ unit squares are marked so that every square, marked or unmarked, is adjacent to at least one marked square. Determine the smallest possible value of $N$.