How many rearrangements of the letters $A,B,C,E$ are there such that no two adjacent letters are also adjacent letters in the alphabet? For example, no such rearrangements could include $AB$ or $BA$, or $BC$ or $CB$.