#include "bits/stdc++.h"

using namespace std;

#define ll long long
#define vi  vector<int>
#define vvi vector<vi>
#define pi  pair<int,int>
#define mp  make_pair
#define pb  push_back
#define MOD 1e9 + 7
#define PAI  3.1415
#define all(x) (x).begin(),(x).end()
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
#define pr(x) cout << x << endl
#define Endl endl
#define rep(i,n) for(int i = 0 ; i < n; i++)

const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
const int ddx[8] = {-1,0,1,-1,1,-1,0,1};
const int ddy[8] = {-1,-1,-1,0,0,1,1,1};
const int inf = 99999999;
const ll linf = 1LL << 62;

ll gcd(ll a,ll b){
  if(a < b)swap(a , b);
  if(a % b != 0) gcd(b, a%b);
  return b;
}

ll lcm(ll a,ll b){
  if(a < b)swap(a , b);
  return (a/gcd(a , b)) * b;
}

int main(){
 
  string s; cin >> s;
  vi v(s.length());

  rep(i, s.length())
    v[i] = s[i] - '0';
  
  sort(v.begin(), v.end(), greater<int>());
  
  int pos1 = -1, pos2 = -1;
  int arr1 = 0, arr2 = 0;
  
  rep(i, s.length()){
    if(v[i] != s[i] - '0'){
      pos1 = i;
      arr1 = v[i];
      arr2 = s[i] - '0';
      for(int j = s.length() - 1; j >= i + 1; j--){
        if(s[j] - '0' == v[i]){
          pos2 = j;
          break;
        }
      }
      break;
    }
  }

  rep(i, s.length()){
    if(i == pos1)
      cout << arr1;
    else if(i == pos2)
      cout << arr2;
    else
      cout << s[i] - '0';
  }

  cout << endl;

  return 0;
}