#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;
  int maxnum = 0;
  int pos = -1;

  for(int i = 0; i < s.length(); i++){
    if(maxnum < s[s.length() - i - 1] - '0'){
      maxnum = s[s.length() - i - 1] - '0';
      pos = s.length() - i - 1;
    }
  } 
  
  int arr = 0;

  rep(i,s.length()){
    if(maxnum > s[i] - '0' and pos > i){
      arr = s[i] - '0';
      cout << maxnum;
      maxnum = 0;
    }
    else if(i == pos and arr != 0)
      cout << arr;
    else
      cout << s[i] - '0';
  }

  cout << endl;

  return 0;
}