#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;

typedef long long ll;
const ll INF = 1000000000;

int main()
{
	ll N; string Ns;
	cin >> N;
	Ns = to_string(N);

	ll max = N;
	for (int i = 0; i < Ns.size(); ++i)
	{
		for (int j = i + 1; j < Ns.size(); ++j)
		{
			char tmp = Ns[i];
			Ns[i] = Ns[j];
			Ns[j] = tmp;

			int score = stoi(Ns);
			if (max < score)
				max = score;

			tmp = Ns[i];
			Ns[i] = Ns[j];
			Ns[j] = tmp;
		}
	}

	cout << max << endl;

	return 0;
}