Proof Writing & Problem Solving · Superchallenge problem

For how many ordered pairs $(m, n)$ of integers with $1 \le m \le 10$ and $1 \le n \le 10$ can an $m \times n$ rectangle be tiled completely by $1 \times 4$ strips (each strip covering four cells in a row or four cells in a column)?