#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    string S;
    cin >> S;
    int n = S.length();
    
    long long ans = stoll(S);
    
    for ( int i = 0; i < n; i++ ) {
    for ( int j = i+1; j < n; j++ ) {
        
        string s;
        // for ( int k = 0; k < n; k++ ) {
            // int x = k;
            // if ( x == i ) { x = j; }
            // else if ( x == j ) { x = i; }
            // s += S[x];
        // }
        
        s = S;
        swap( s[i], s[j] );
        
        
        ans = max( ans, stoll( s ) );        
    }
    }
    
    cout << ans << endl;
    
    return 0;
}