Sorting an array

There's an array of values from 1 to n. It isn't sorted. We have to sort it, but there are only to ways to move: third element to beginning or last element to beginning. How to do that ?

Bumping for hint towards general proof that the unsolvable cases are indeed such.
I tried looking for invariants, but no luck.