Consider o=1, r=2, a=3, n=4, g=5, e=6. So you have the permutation and you have to fine the number fixed-point-free permutations. You should count all the permutations which have at least one fixed point, note with the set of permutations for which i is a fixed point and use the Inclusion–exclusion principle.