#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n)  { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x)         { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};
int key = 0;
int N;
ll ma=0;
ll ans;
ll n;

void saiki(int idx,ll num) {
	if (idx == N) {
		if (ma < min(abs(n - num), (ll)pow(10, N) - abs(n - num))) {
			ma = max(ma, min(abs(n - num), (ll)pow(10, N) - abs(n - num)));
			ans = num;
		}
		else if (ma == min(abs(n - num), (ll)pow(10, N) - abs(n - num))) {
			ans = min(ans,num);
		}
		return;
	}
	REP(i, 10) {
		if (!(key&(1 << i))) {
			key |= (1 << i);
			saiki(idx + 1, num * 10 + i);
			key &= ~(1 << i);
		}
	}
}
int main() {
	string s;
	cin >> s;
	n = atol(s.c_str());
	ans = n;
	N = s.length();
	saiki(0, 0);
	REP(i,N)
	cout <<ans/(ll)pow(10,N-i-1)%10;
	cout << endl;
}