#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

// 上がってるか
bool check(string s){
    sort(ALL(s));

    map<char,int> cnt;
    for(auto c:s)cnt[c]++;
    bool titoi=true;
    for(auto p:cnt){
        if(p.second!=2) titoi=false;
        if(p.second>4) return false;
    }
    if(titoi) return true;
    
    for(char head='1';head<='9';head++){
        if(cnt[head]<2) continue;

        int unko=0;
        auto cp=cnt;
        cp[head]-=2;
        for(char p='1';p<='9';p++){
            unko+=cp[p]/3;
            cp[p]%=3;
        }

        for(char p='1';p<='7';p++){
            int mini=min({cp[p],cp[p+1],cp[p+2]});
            cp[p]-=mini;
            cp[p+1]-=mini;
            cp[p+2]-=mini;
            unko+=mini;
        }
        if(unko==4) return true;
    }
    return false;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    string s;cin>>s;
    sort(ALL(s));

    if(s=="1112345678999"){
        rep(i,9) cout<<i+1<<endl;
        return 0;
    }
    
    for(char add='1';add<='9';add+=1){
        s.push_back(add);
        if(check(s)) cout<<add<<endl;
        s.pop_back();
    }

    return 0;
}