#include<bits/stdc++.h>
using namespace std;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

using ll=long long;
using u32=unsigned int;
using u64=unsigned long long;
using i128=__int128;
using u128=unsigned __int128;
using f128=__float128;

using pii=pair<int,int>;
using pll=pair<ll,ll>;

template<typename T> using vc=vector<T>;
template<typename T> using vvc=vc<vc<T>>;
template<typename T> using vvvc=vc<vvc<T>>;

using vi=vc<int>;
using vll=vc<ll>;
using vvi=vc<vi>;
using vvll=vc<vll>;

#define vv(type,name,n,...) \
    vector<vector<type>> name(n,vector<type>(__VA_ARGS__))
#define vvv(type,name,n,m,...) \
    vector<vector<vector<type>>> name(n,vector<vector<type>>(m,vector<type>(__VA_ARGS__)))

template<typename T> using min_heap=priority_queue<T,vector<T>,greater<T>>;
template<typename T> using max_heap=priority_queue<T>;

// https://trap.jp/post/1224/
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s)))

template<typename T, typename S> constexpr T ifloor(const T a, const S b){return a/b-(a%b&&(a^b)<0);}
template<typename T, typename S> constexpr T iceil(const T a, const S b){return ifloor(a+b-1,b);}

template<typename T>
void sort_unique(vector<T> &vec){
    sort(vec.begin(),vec.end());
    vec.resize(unique(vec.begin(),vec.end())-vec.begin());
}

template<typename T, typename S> constexpr bool chmin(T &a, const S b){if(a>b) return a=b,true; return false;}
template<typename T, typename S> constexpr bool chmax(T &a, const S b){if(a<b) return a=b,true; return false;}

template<typename T, typename S> istream& operator >> (istream& i, pair<T,S> &p){return i >> p.first >> p.second;}
template<typename T, typename S> ostream& operator << (ostream& o, const pair<T,S> &p){return o << p.first << ' ' << p.second;}

#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 777771449
#endif

template<typename T> void print(vector<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(unordered_set<T> x){for(auto i: x) cout << i << ' ';cout << "\n";}
template<typename T> void print(T && x) {cout << x << "\n";}
template<typename T, typename... S> void print(T && x, S&&... y) {cout << x << ' ';print(y...);}

template<typename T> istream& operator >> (istream& i, vector<T> &vec){for(auto &x: vec) i >> x; return i;}

vvi read_graph(int n, int m, int base=1){
    vvi adj(n);
    for(int i=0,u,v; i<m; ++i){
        cin >> u >> v,u-=base,v-=base;
        adj[u].pb(v),adj[v].pb(u);
    }
    return adj;
}

vvi read_tree(int n, int base=1){return read_graph(n,n-1,base);}

template<typename T, typename S> pair<T,S> operator + (const pair<T,S> &a, const pair<T,S> &b){return {a.first+b.first,a.second+b.second};}

template<typename T> constexpr T inf=0;
template<> constexpr int inf<int> = 0x3f3f3f3f;
template<> constexpr ll inf<ll> = 0x3f3f3f3f3f3f3f3f;

template<typename T> vector<T> operator += (vector<T> &a, int val){for(auto &i: a) i+=val; return a;}

template<typename T> T isqrt(const T &x){T y=sqrt(x+2); while(y*y>x) y--; return y;}

#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())

#include<atcoder/all>
using namespace atcoder;

//using mint=modint998244353;
//using mint=modint1000000007;

vi vals[10];

void mango(){
    vals[0].pb(bitset<7>("1110111").to_ulong());
    vals[0].pb(bitset<7>("0001111").to_ulong());
    vals[1].pb(bitset<7>("0010010").to_ulong());
    vals[1].pb(bitset<7>("0100100").to_ulong());
    vals[2].pb(bitset<7>("1011101").to_ulong());
    vals[3].pb(bitset<7>("1011011").to_ulong());
    vals[4].pb(bitset<7>("0111010").to_ulong());
    vals[5].pb(bitset<7>("1101011").to_ulong());
    vals[6].pb(bitset<7>("1101111").to_ulong());
    vals[6].pb(bitset<7>("0101111").to_ulong());
    vals[7].pb(bitset<7>("1010010").to_ulong());
    vals[7].pb(bitset<7>("1110010").to_ulong());
    vals[8].pb(bitset<7>("1111111").to_ulong());
    vals[9].pb(bitset<7>("1111011").to_ulong());
    vals[9].pb(bitset<7>("1111010").to_ulong());

    string s; cin >> s;
    vll cur_val(sz(s)+1);
    rep(sz(s)) cur_val[i+1]=cur_val[i]*10+(s[i]-'0');
    map<array<int,7>,ll> vis[20],vis2[20];
    vll pw10(19);
    pw10[0]=1;
    rep(i,1,19) pw10[i]=pw10[i-1]*10;
    ll res=inf<ll>;
    auto dfs=[&](auto &self, int pos, ll val, array<int,7> arr){
        if(val>0&&val*pw10[sz(s)-pos]>=res) return;
        if((*max_element(all(arr)))-(*min_element(all(arr)))>sz(s)-pos) return;
        assert(val>=cur_val[pos]);
        if(pos==sz(s)){
            if((*max_element(all(arr)))==(*min_element(all(arr)))){
                chmin(res,val);
            }
            return;
        }
        if(val>cur_val[pos]){
            if(vis[pos].count(arr)&&vis[pos][arr]<=val) return;
            vis[pos][arr]=val;
        }
        else{
            if(vis2[pos].count(arr)) return;
            vis2[pos][arr]=val;
        }
        rep(t,10){
            if(val*10+t<cur_val[pos+1]) continue;
            for(auto v: vals[t]){
                auto arr2=arr;
                rep(7) if(v>>i&1){
                    arr2[i]++;
                }
                self(self,pos+1,val*10+t,arr2);
            }
        }
    };
    dfs(dfs,0,0,{0,0,0,0,0,0,0});
    if(sz(s)<=18){
        for(auto val: vals[1]){
            array<int,7> arr={0,0,0,0,0,0,0};
            rep(7) if(val>>i&1){
                arr[i]++;
            }
            dfs(dfs,0,1,arr);
        }
    }
    print(res);
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--) mango();
}