#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int toi(vector<int> &v, int a, int b)
{
	int res = 0;
	REP(i, v.size()) {
		res *= 10;
		if (i == a) res += v[b];
		else if (i == b) res += v[a];
		else res += v[i];
	}
	return res;
}

int main(int argc, char **argv) {
	vector<int> v;
	string N;
	cin >> N;
	REP(i, N.length()) v.push_back(N[i] - '0');
	int res = toi(v, 0, 0);
	REP(i, v.size()) FOR(j, i + 1, v.size()) res = max(res, toi(v, i, j));
	cout << res << endl;
	return 0;
}