Number Slide 2

Problem Description

While learning programming, Little J discovered the modulo operator %, and wrote a small program that lets a number play a "slide" game.

Today Little J wants to try sliding in the other direction. For example, given the input 12345, the program should output in order: 51234, 45123, 34512, 23451, 12345.

Write one yourself and have a play!

Input Format

One positive integer $n$ ($0 < n < 2^{31}$), in which no digit is $0$ and every digit appears at most once.

Output Format

Output the result of sliding this number, with the numbers separated by a single space.

Sample Input 1

6

Sample Output 1

6

Sample Input 2

573

Sample Output 2

357 735 573