How many rearrangements of the letters $A,C,E,G$ are there in which no two adjacent letters are also adjacent in the sequence $A,C,E,G$? For example, no such rearrangements could include $AC$ or $CA$, or $CE$ or $EC$, or $EG$ or $GE$.