12 knights are sitting at a round table. Each knight is an enemy with the two knights adjacent to them, but not with any of the others. We need to choose 5 knights to save the princess such that no two knights in the group are enemies. How many ways can this be done?

Let's think step by step and output the final answer within \boxed{}.
user