Number Slide

Problem Description

While learning to program, little J discovered the modulo operator %, and thought up a little "slide" game for numbers.

For example, given the input 12345, the program should output in turn: 12345, 23451, 34512, 45123, 51234.

Write your own program to play this game too!

Input Format

A positive integer $n$ ($0 \lt n \lt 2^{31}$), in which no digit is zero.

Output Format

Output the "sliding" result of this number, one number per line.

Sample Input 1

5

Sample Output 1

5

Sample Input 2

123

Sample Output 2

123
231
312

Hint

$123\Rightarrow 23\times10 + 123\div100 \Rightarrow 230+1 \Rightarrow 231$.

Here $100$ is the value represented by the highest digit of $123$ (the hundreds place). So, how do you obtain the highest digit of $n$?