Writing It Up · Medium problem

$n \equiv 1 \pmod 4$; $n \equiv 3 \pmod 4$

$n$ even; $n$ odd

$n > 0$; $n < 0$

$n$ prime; $n$ composite