#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
    each(x,vec) is >> x;
    return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    rep(i,vec.size()) {
        if (i) os << " ";
        os << vec[i];
    }
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
    rep(i,vec.size()) {
        if (i) os << endl;
        os << vec[i];
    }
    return os;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    string s; cin >> s;
    const ll n = s.size();
    string ans = "";
    ll p = 1; rep(i, n) p *= 10;
    auto f = [&](const string& ns) {
        ll d = abs(stoll(s) - stoll(ns));
        return min(d, p-d);
    };
    vector<bool> used(10, false);
    vector<ll> v(n);
    function<void(ll)> dfs = [&](ll pos) {
        if (pos == n) {
            string a = "";
            rep(i, n) a += char('0'+v[i]);
            if (ans == "" || f(a) > f(ans)) ans = a;
            else if (f(a) == f(ans)) chmin(ans, a);
        }
        else {
            rep(i, 10) {
                if (used[i]) continue;
                used[i] = true;
                v[pos] = i;
                dfs(pos+1);
                used[i] = false;
            }
        }
    };
    dfs(0);
    cout << ans << endl;
}
### Prompt

Develop a solution in cpp to the problem described below:

Example

Input

201


Output

701

### Response

```cpp
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
    each(x,vec) is >> x;
    return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    rep(i,vec.size()) {
        if (i) os << " ";
        os << vec[i];
    }
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
    rep(i,vec.size()) {
        if (i) os << endl;
        os << vec[i];
    }
    return os;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    string s; cin >> s;
    const ll n = s.size();
    string ans = "";
    ll p = 1; rep(i, n) p *= 10;
    auto f = [&](const string& ns) {
        ll d = abs(stoll(s) - stoll(ns));
        return min(d, p-d);
    };
    vector<bool> used(10, false);
    vector<ll> v(n);
    function<void(ll)> dfs = [&](ll pos) {
        if (pos == n) {
            string a = "";
            rep(i, n) a += char('0'+v[i]);
            if (ans == "" || f(a) > f(ans)) ans = a;
            else if (f(a) == f(ans)) chmin(ans, a);
        }
        else {
            rep(i, 10) {
                if (used[i]) continue;
                used[i] = true;
                v[pos] = i;
                dfs(pos+1);
                used[i] = false;
            }
        }
    };
    dfs(0);
    cout << ans << endl;
}
```