Proof Writing & Problem Solving · Easy problem

A proof about two integers $m$ and $n$ splits into cases by whether each of $m$ and $n$ is even or odd, and does NOT use symmetry to merge any cases. How many cases does the write-up have?