How many rearrangements of the letters $A,B,C,D$ are there such that no two adjacent letters are separated by exactly one letter in the alphabet? For example, no such rearrangements could include $AC$ or $CA$, or $BD$ or $DB$.