#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

int main() {
  string s;
  cin >> s;

  string ans = s;
  int n = sz(s);
  //   rep(i, n) rep(j, i) {
  //     swap(s[i], s[j]);
  //     ans = max(ans, s);
  //     swap(s[i], s[j]);
  //   }

  vector<int> ls(n + 1, -1);
  P mx(-1, -1);
  drep(i, n) {
    int c = s[i] - '0';
    mx = max(mx, P(c, i));
    auto [val, id] = mx;
    ls[i] = id;
  }
  rep(i, n - 1) {
    auto [val, id] = mx;
    swap(s[i], s[id]);
    ans = max(ans, s);
    swap(s[i], s[id]);
  }
  cout << ans << endl;
  return 0;
}