#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)

int main(){
    string N;
    cin >> N;
    bool flg = true;
    for(int j=0;j<N.length()&&flg;j++){
        char max_num = '0';
        int max_ix = 0;
        for(int i=j;i<N.length();i++){
            if(max_num <= N[i]){
                max_num = N[i];
                max_ix = i;
            }
        }

        for(int i=j;i<N.length()&&i<max_ix;i++){
            if(max_num > N[i]){
                swap(N[i],N[max_ix]);
                flg = false;
                break;
            }
        }
    }
    cout << N << endl;

}