If one rearranges a string of n different items so that no one item appears in its original position that is called aderangement.

The number of derangements of n items is given by .

So to rearrange so that at least six numbers remain in the correct position can be done

in number of ways.