#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define int ll
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a*b/gcd(a,b);
}

int f(string s){
    int ret = 0;
    rep(i,s.size()){
        ret *= 10;
        ret += s[i]-'0';
    }
    return ret;
}

signed main(void) {
    int i,j;
    string s;
    cin >> s;
    int n = s.size();
    int num = f(s);
    vi v(10);
    rep(i,10)v[i] = i;
    string ans;
    int diff = 0;
    int MAX = 1;
    rep(i,n)MAX *= 10;
    do{
        string t = "";
        rep(i,n)t += v[i]+'0';
        int p = abs(num-f(t));
        int tmp = min(p, MAX-p);
        if(tmp > diff){
            diff = tmp;
            ans = t;
        }
    }while(next_permutation(all(v)));
    cout << ans << endl;
}

