#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    string n;
    cin >> n;
    char mx = *max_element(n.begin(),n.end());
    for (int i = 0; i < n.size() - 1; i++) {
        if (n[i] == mx) {
            mx = *max_element(n.begin()+i+1,n.end());
            continue;
        }
        for (int j = n.size()-1; i < j; j--) {
            if (n[j] == mx) {
                swap(n[i],n[j]);
                cout << n << endl;
                return 0;
            }
        }
    }
    cout << n << endl;
    return 0;
}