Row Reduction & Rank · Superchallenge problem

Working over the field $\mathbb F_2 = \{0, 1\}$ (arithmetic mod $2$), how many $3 \times 3$ matrices have rank exactly $2$?