#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<class T>
istream& operator >> (istream& is, vector<T>& v)
{
	for (auto &i : v) is >> i;
	return is;
}
template<class T>
ostream& operator<<(ostream& os, vector<T>& v)
{
	const string delimiter = "\n";
	REP(i, v.size())
	{
		os << v[i];
		if (i != v.size() - 1) os << delimiter;
	}
	return os;
}
/*--------------------template--------------------*/

int main()
{
	cin.sync_with_stdio(false); cout << fixed << setprecision(10);
	string s = "0123456789";
	string t; cin >> t;
	int n = t.size();
	string ans;
	ll dif = -1;
	do
	{
		string ss = s.substr(0, n);
		ll a = abs(stoll(ss) - stoll(t));
		ll b = min(a, ll(pow(10, n) - a));
		if (dif < b)
		{
			dif = b;
			ans = ss;
		}
		if (dif == b)
		{
			chmin(ans, ss);
		}
	} while (next_permutation(ALL(s)));
	cout << ans << endl;
	return 0;
}

### Prompt

Generate a CPP solution to the following problem:

Example

Input

201


Output

701

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<class T>
istream& operator >> (istream& is, vector<T>& v)
{
	for (auto &i : v) is >> i;
	return is;
}
template<class T>
ostream& operator<<(ostream& os, vector<T>& v)
{
	const string delimiter = "\n";
	REP(i, v.size())
	{
		os << v[i];
		if (i != v.size() - 1) os << delimiter;
	}
	return os;
}
/*--------------------template--------------------*/

int main()
{
	cin.sync_with_stdio(false); cout << fixed << setprecision(10);
	string s = "0123456789";
	string t; cin >> t;
	int n = t.size();
	string ans;
	ll dif = -1;
	do
	{
		string ss = s.substr(0, n);
		ll a = abs(stoll(ss) - stoll(t));
		ll b = min(a, ll(pow(10, n) - a));
		if (dif < b)
		{
			dif = b;
			ans = ss;
		}
		if (dif == b)
		{
			chmin(ans, ss);
		}
	} while (next_permutation(ALL(s)));
	cout << ans << endl;
	return 0;
}

```