Number of permutations of set {1, 2, ..., n} for which insertion sort will perform exactly n permutations
Your analysis looks correct to me. The answer should be N-2, not 2(N-1).

It wouldn't be unheard of for graders/teachers to work with an incorrect solution.