#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
#include <set>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define P pair<int, int>

#define MOD 1000000007
#define INF 1012345678
#define NINF (-2147483647-1)
#define LLINF 9223372036854775807
using ll = long long;
using namespace std;

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