#include <bits/stdc++.h>

#define pout(n)  printf ("%d\n", n)

#define rep(i,a,n) for (int i = a;i < n;i++)
#define per(i,n,a) for (int i = n-1;i >= a;i--)

const int d4x[4] = {1, 0, -1, 0};
const int d4y[4] = {0, 1, 0, -1};
const int d8x[8] = { 1,1,0,-1,-1,-1,0,1 };
const int d8y[8] = { 0,1,1,1,0,-1,-1,-1 };

#define MAX_N (int)2e5+20
#define INF 1e12+20

typedef long long ll;
using namespace std;

int n,m,l;
string s;
int main() {
    cin >> s;
    n = s.size();
    rep(i,0,n){
        m = s[i];
        l = i;
        per(j,n,i+1){
            if(m < s[j]){
                m = s[j];
                l = j;
            }
        }
        if(l != i){
            swap(s[i],s[l]);
            break;
        }
    }
    cout << s << endl;
    return 0;
}