#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define rep(i,n) for (int i = 0; i < (n); ++i)

using namespace std;
using ll = long long;
using P = pair<int,int>;
using namespace std;

const int MOD = 1000000007; // 10^9 + 7

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  string n;cin >> n;
  int size = n.size();

  for (int i = 0; i < size; i++) {
    int maxIdx = i;
    char maxNum = n[i];

    for (int j = i + 1; j < size; j++) {
      if (maxNum <= n[j]) {
        maxNum = n[j];
        maxIdx = j;
      }
    }

    if (maxIdx != i) {
      char tmp = n[i];
      n[i] = n[maxIdx];
      n[maxIdx] = tmp;

      break;
    }
  }

  cout << n << endl;
}