#0000EE

Lektira

Mario is making up silly games again instead of reading Dostoevsky for school. The rules of his newestgame follow.

First he chooses a random word from the book. Then he splits the word in two arbitrary places to get three separate words. After that he reverses the order of the letters in each of those three words (exchanges the first and last etters, the second and second last and so on). Finally, he puts the three words back together in the same order in which they were before splitting.


The goal of the game is to obtain the lexicographically smallest word possible. In other words, of all words that can be obtained by the above procedure, find one which would be earliest in a dictionary.

Write a program that plays Mario's game perfectly.


InputThe first and only line of input contains Mario's chosen word, a string of lowercase letters of the English alphabet with no spaces. The input word will be between 3 and 50 characters long (inclusive).

OutputOutput the best word on a single line.

input
dcbagfekjih

output
abcdefghijk

input
mobitel

output
bometil

input
anakonda

output
aanadnok

Submit solution

Coming later

The grading service will be connected in a later migration step. You can inspect the task and your previous results now.