#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>

#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF 1000000000
#define MOD 1000000009
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef std::pair<int,int> pii;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

int solve(string s){
    int ma=stoi(s);
    rep(i,0,s.length()-1){
        rep(j,i+1,s.length()){
           string ss=s;
           char temp=ss[i];
           ss[i]=ss[j];
           ss[j]=temp;
           ma=max(ma,stoi(ss));
        }
    }
    return ma;
}

int main(){
    string s;
    cin>>s;
    cout<<solve(s)<<endl;
    return 0;
}