#include using namespace std; #define all(c) ((c).begin()), ((c).end()) #define dump(c) cerr << "> " << #c << " = " << (c) << endl; #define iter(c) __typeof((c).begin()) #define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++) #define REP(i, a, b) for (int i = a; i < (int)(b); i++) #define rep(i, n) REP(i, 0, n) #define mp make_pair #define fst first #define snd second #define pb push_back #define debug( fmt, ... ) \ fprintf( stderr, \ fmt "\n", \ ##__VA_ARGS__ \ ) typedef unsigned int uint; typedef long long ll; typedef unsigned long long ull; typedef vector vi; typedef vector vll; typedef vector vvll; typedef vector vvi; typedef vector vd; typedef vector vvd; typedef vector vs; typedef pair pii; typedef pair pll; const int INF = 1 << 30; const double EPS = 1e-10; double zero(double d) { return d < EPS ? 0.0 : d; } templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b ostream &operator<<(ostream &os, const pair &p) { return os << '(' << p.first << ',' << p.second << ')'; } template ostream &operator<<(ostream &os, const vector &a) { os << '['; rep(i, a.size()) os << (i ? " " : "") << a[i]; return os << ']'; } string toString(int i) { stringstream ss; ss << i; return ss.str(); } const int MOD = 1000000007; // a^k ll fpow(ll a, ll k, int M) { ll res = 1ll; ll x = a; while (k != 0) { if ((k & 1) == 1) res = (res * x) % M; x = (x * x) % M; k >>= 1; } return res; } struct prepare { prepare() { cout.setf(ios::fixed, ios::floatfield); cout.precision(8); ios_base::sync_with_stdio(false); } } _prepare; int main() { ll N; cin >> N; ll orig_N = N; vi digit; while(N > 0) { digit.push_back(N % 10); N /= 10; } reverse(all(digit)); int mx = 0; rep(i, digit.size()) { chmax(mx, digit[i]); } int mx_pos = -1, nmax_pos = -1; rep(i, digit.size()){ if(digit[i] == mx) { mx_pos = i; } if(digit[i] != mx && nmax_pos == -1) { nmax_pos = i; } } if(nmax_pos < mx_pos && nmax_pos != -1) swap(digit[mx_pos], digit[nmax_pos]); ll newN = 0; rep(i, digit.size()) { newN *= 10; newN += digit[i]; } cout << max(orig_N, newN) << endl; return 0; }