Lance has a regular heptagon. 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.
There are 7! = 5040 ways to label the heptagon. There are 4! = 24 ways where the O's are next to an N, so the number of ways where N is not next to an O is 5040 - 24 = 5016.
