#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int main()
{
	string n; cin >> n;
	int mx = 0,ind = 0;

	for (int i = 0; i < n.size(); i++) {
		mx = 0;
		for (int j = n.size()-1; j > i; j--) {
			if (n[i] - '0' < n[j] - '0') {
				if (mx < n[j]) {
					mx = n[j];
					ind = j;
				}
			}
		}
		if (mx != 0) {
			swap(n[i], n[ind]);
			break;
		}
	}
	cout << n << endl;
	return	0;
}