Twelve (\(12\)) knights sit around a round table. Every knight hates the two (\(2\)) knights sitting next to him, but none of the other nine (\(9\)) knights. A task group of five (\(5\)) knights is to be sent to save a princess in trouble. No two (\(2\)) knights who hate each other can be included in the group. In how many ways can the group be selected?