#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>
#include <utility>

typedef long long ll;
using namespace std;

typedef pair<int, int> P;



int main() {

	string s;
	cin>>s;

	int tt=0;

	for(int i=9; i>=2; i--){

		for(int j=s.length()-1; j>=0+tt; j--){

			if(s[j]-'0' == i){


				int t=0;
				bool judge =false;
				for(int k=0; k<s.length();k++){

					if(s[j]-'0'> s[k]-'0'){
						t=k;
						judge =true;
						break;
					}

				}

/*				cout<<j<<" "<<tt<<endl;*/
				if(j !=tt && judge ){
				char a = s[t];
				s[t] = s[j];
				s[j] = a;
				cout<<s<<endl;
				return 0;
				}
				tt++;

/*				cout<<s<<endl;
				return 0;
	*/		}
		}
	}
	cout<<s<<endl;


	return 0;
}