#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  string s;
  cin >> s;
  string t = s;
  sort(t.rbegin(), t.rend());

  int m_ind = 0, n = s.size();
  bool flg = false;
  rep(i, 0, n) {
    if (s[i] != t[m_ind]) {
      repr(j, 0, n) {
        if (s[j] == t[m_ind]) {
          swap(s[i], s[j]);
          flg = true;
          break;
        }
      }
      if (flg)
        break;
    }
    m_ind++;
  }
  cout << s << endl;
}