Lance has a regular heptagon (7-sided figure). How many distinct ways can he label the vertices of the heptagon with the letters in OCTAGON if the N cannot be next to an O ? Rotations of the same labeling are considered equivalent.
I'm not sure how to solve this.