Show that these languages are not context$-$free:

The language of strings over $\{1,2,3,4\}$ with equal numbers of $1$s and $2$s and equal numbers of $3$s and $4$s