/*
TASK:names
LANG:C++
*/

#include<stdio.h>
#include<string>

using namespace std;
void solve();

string S, s1, s2, s3, best, f;
char g[1 << 21];

int main()
{
solve();
return 0;
}

void solve()
{
int i, j, N;

while(!feof(stdin))
    {
    gets(g);
    S.assign(g);
    N = S.length();
    best = S;
    for(i = 0; i < N - 1; i++)
          for(j = i + 1; j < N; j++)
                {
                s1 = S.substr(0, i + 1);
                s2 = S.substr(i + 1, j - i);
                s3 = S.substr(j + 1, N - j);
                f = s1 + s3 + s2;
                if(f < best) best = f;
                f = s2 + s1 + s3;
                if(f < best) best = f;                
                f = s2 + s3 + s1;
                if(f < best) best = f;                
                f = s3 + s1 + s2;
                if(f < best) best = f;                
                }
    printf("%s\n", best.c_str());
    }

}


