The challenge here is to take a string:
    "john", for example

And print all possible inversions of it, until the characters are in their original order, as shown below:

john

ohnj

hnjo

njoh

john

   Shortest answer wins!