#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

long long strToInt(const string &s) {
    long long res = 0;
    for (auto e : s) res = res * 10 + e - '0';
    return res;
}

long long calcDiff(const string &s, const string &news) {
    const int L = s.length();
    long long snum = strToInt(s), newsnum = strToInt(news);
    return min<long long>(llabs(snum - newsnum), powl(10, L) - llabs(snum - newsnum));
}

int main(void) {
    string s;
    cin >> s;
    vector<int> v(10);
    iota(begin(v), end(v), 0);
    string ans = s;
    const int L = s.length();
    long long diff = 0;
    do {
        string news = "";
        for (int i = 0; i < L; i++) {
            news += v[i] + '0';
        }
        const long long buf = calcDiff(s, news);
        if (diff < buf) {
            ans = news;
            diff = buf;
        } else if (diff == buf) {
            const long long newsnum = strToInt(news);
            const long long ansnum = strToInt(ans);
            if (newsnum < ansnum) {
                ans = news;
                diff = buf;
            }
        }
    } while (next_permutation(begin(v), end(v)));
    cout << ans << endl;
}
### Prompt

Please provide a cpp coded solution to the problem described below:

Example

Input

201


Output

701

### Response

```cpp
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

long long strToInt(const string &s) {
    long long res = 0;
    for (auto e : s) res = res * 10 + e - '0';
    return res;
}

long long calcDiff(const string &s, const string &news) {
    const int L = s.length();
    long long snum = strToInt(s), newsnum = strToInt(news);
    return min<long long>(llabs(snum - newsnum), powl(10, L) - llabs(snum - newsnum));
}

int main(void) {
    string s;
    cin >> s;
    vector<int> v(10);
    iota(begin(v), end(v), 0);
    string ans = s;
    const int L = s.length();
    long long diff = 0;
    do {
        string news = "";
        for (int i = 0; i < L; i++) {
            news += v[i] + '0';
        }
        const long long buf = calcDiff(s, news);
        if (diff < buf) {
            ans = news;
            diff = buf;
        } else if (diff == buf) {
            const long long newsnum = strToInt(news);
            const long long ansnum = strToInt(ans);
            if (newsnum < ansnum) {
                ans = news;
                diff = buf;
            }
        }
    } while (next_permutation(begin(v), end(v)));
    cout << ans << endl;
}
```