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

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  string s;
  cin >> s;
  int n = s.size();
  int ans = stoi(s);
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      string t = s;
      swap(t[i], t[j]);
      int res = stoi(t);
      ans = max(ans, res);
    }
  }
  cout << ans << endl;
  return 0;
}