#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N;
char S[1'000'010];


namespace brute {
string run() {
cerr<<"[brute::run]"<<endl;
  string s = S;
  reverse(s.begin() + 1, s.end());
  do {
    bool ok = true;
    for (int i = 1; i < N; ++i) {
      for (int j = 0, jj = i; j < N; ++j, ++jj) {
        if (jj == N) jj = 0;
        if (s[j] < s[jj]) break;
        if (s[j] > s[jj]) { ok = false; break; }
      }
      if (!ok) break;
    }
    if (ok) {
      return s;
    }
  } while (prev_permutation(s.begin() + 1, s.end()));
  assert(false);
}
}  // brute


int main() {
  for (; ~scanf("%s", S); ) {
    N = strlen(S);
    sort(S, S + N);
    
    const string ans = brute::run();
    puts(ans.c_str());
  }
  return 0;
}