#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#include <functional>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
using ll = unsigned long long;
const ll mod = 1000000007;
string al = "abcdefghijklmnopqrstuvwxyz";
//bool less_sec(const pair<int, int>&a, const pair<int, int>&b) {
//	return a.second > b.second;
//}
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	string s; cin >> s;
	string maxV=s;
	for (int i = s.size()-1; i >=0; --i) {
		for (int j = s.size() - 1; j >= 0; --j) {
			string tmp; swap(s[i], s[j]); tmp = s;
			swap(s[i], s[j]);
			if (maxV < tmp) maxV = tmp;
		}
	}
	cout << maxV << endl;
	return 0;
}