#define  _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")

#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144*2LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()

unsigned long xor128() {
	static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void init() {
	iostream::sync_with_stdio(false);
	cout << fixed << setprecision(20);
}

#define int ll

void solve(){
	string s;
	cin >> s;
	ll geko = 1;
	REP(i, s.length()) {
		geko *= 10;
	}
	ll ans = -1;
	ll now_itr = 0;
	vector<char> inputs;
	REP(i, 10) {
		inputs.push_back('0' + i);
	}
	do {
		string b;
		REP(q, s.length()) {
			b.push_back(inputs[q]);
		}
		ll tmp = llabs(stoll(b) - stoll(s));
		tmp = min(tmp, geko - tmp);
		if (tmp > ans||(tmp == ans&&now_itr >= stoll(b))) {
			ans = tmp;
			now_itr = stoll(b);
		}
	} while (next_permutation(ALL(inputs)));
	string a = to_string(now_itr);
	while (a.length() != s.length()) {
		a.insert(a.begin(), '0');
	}
	cout << a << endl;
}

#undef int
int main() {
	init();
	solve();
}
