#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[a]; if (a != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

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


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///

ll sll(string s) {
	ll ret = 0;
	REP(i, s.size()) {
		ret *= 10;
		ret += s[i] - '0';
	}
	return ret;
}
ll dist(string s, string t) {
	return abs(sll(s) - sll(t));
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	string s;
	cin >> s;
	int n = s.size();
	string ans;
	ll cmax = -INF;
	REP(i, 1 << 10) {
		int cnt = 0;
		REP(j, 10)if (i&(1 << j))cnt++;
		if (cnt != n)continue;
		string t;
		REP(j, 10) {
			if (i&(1 << j))t += char('0' + j);
		}
		sort(ALL(t));
		do {
			ll a = min(dist(s, t),ll(pow(10,n))-dist(s,t));
			if (a > cmax||(a==cmax&&sll(ans)>sll(t))) {
				cmax = a;
				ans = t;
			}
		} while (next_permutation(ALL(t)));
	}
	cout << ans << endl;
	
	return 0;
}
### Prompt

Develop a solution in Cpp to the problem described below:

Example

Input

201


Output

701

### Response

```cpp
#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[a]; if (a != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

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


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///

ll sll(string s) {
	ll ret = 0;
	REP(i, s.size()) {
		ret *= 10;
		ret += s[i] - '0';
	}
	return ret;
}
ll dist(string s, string t) {
	return abs(sll(s) - sll(t));
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	string s;
	cin >> s;
	int n = s.size();
	string ans;
	ll cmax = -INF;
	REP(i, 1 << 10) {
		int cnt = 0;
		REP(j, 10)if (i&(1 << j))cnt++;
		if (cnt != n)continue;
		string t;
		REP(j, 10) {
			if (i&(1 << j))t += char('0' + j);
		}
		sort(ALL(t));
		do {
			ll a = min(dist(s, t),ll(pow(10,n))-dist(s,t));
			if (a > cmax||(a==cmax&&sll(ans)>sll(t))) {
				cmax = a;
				ans = t;
			}
		} while (next_permutation(ALL(t)));
	}
	cout << ans << endl;
	
	return 0;
}
```