#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#include <queue>
#include <stack>

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define REP(i,a,n) for(int i = (a);i < (n);i++)
#define PI 3.14159265359
#define MOD 1000007
#define chmax(a,b) if(a < b)a = b

using namespace std;

int main(){
    string s;
    cin >> s;
    int m,index = 0,j;
    for(j = 0;j < s.length();j++){
        m = s[j]-'0',index = j;
        for(int i = s.length()-1;i > j;i--){
            if(m < s[i]-'0'){
                m = s[i]-'0';
                index = i;
            }
        }
        if(index != j)break;
    }
    swap(s[j], s[index]);
    cout << s << endl;
    return 0;
}