#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main(void){
  string s; cin >> s;
  int n=s.size();
  vector<P> mx(n);
  mx[n-1]=P(s[n-1]-'0', n-1);
  for(int i=n-2; i>=0; i--){
    mx[i]=max(mx[i+1], P(s[i]-'0', i));
  }
  for(int i=0; i<n; i++){
    P now=P(s[i]-'0', i);
    if(mx[i]!=now){
      swap(s[mx[i].second], s[i]);
      break;
    }
  }
  cout << s << endl;
  return 0; 
}