#include <bits/stdc++.h>
#include <atcoder/all>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace atcoder;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vll=vector<ll>;
using vvll=vector<vll>;
using pll=pair<ll,ll>;

// using mint=modint;

// template<class K,class V>
// using ordered_map=tree<K,V,less<K>,rb_tree_tag,tree_order_statistics_node_update>;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

    ll N;
    cin>>N;
    vll suff,n;

    while(N>0){
        ll r=N%10;
        n.push_back(r);
        if(suff.size()>0)suff.push_back(max(suff.back(),r));
        else suff.push_back(r);
        N/=10;
    }

    ll m=n.size(),j=-1;
    for(int i=m-1;i>=0;--i){
        if(n[i]<suff[i]){
            j=i;
            break;
        }
    }

    if(j!=-1){
        for(int i=0;i<m;++i){
            if(n[i]==suff[j]){
                swap(n[i],n[j]);
                break;
            }
        }
    }

    ll B=1;
    for(int i=0;i<m;++i){
        N+=n[i]*B;
        B*=10;
    }

    cout<<N<<endl;
}