Let $n$ be an odd integer. Consider a square lattice of size $n \times n$, consisting of $n^2$ unit squares and $2n(n +1)$ edges. All edges are painted in red or blue so that the number of red edges does not exceed $n^2$. Prove that there is a cell that has at least three blue edges.