/*
TASK:names
LANG:C++
*/
#include <iostream>
#include <string>
using namespace std;
string s;
int main() {
    while(cin>>s) {
       string best = s;
       int n = s.size();
       for(int i=1;i<n;i++) {
          string ns = s.substr(0,i);
          string nsa = s.substr(i, n);
          string next = nsa + ns;
          if(best > next) best = next;
          for(int j=i+1;j<n;j++) {
                  string cur = s.substr(i,(j-i));
                  string last = s.substr(j, n);
                  string next = cur + ns + last;
                  if(best > next) best = next;
                  next = ns + last + cur;
                  if(best > next) best = next;
          }
       }
       cout << best << endl;
    }
    return 0;
}
