#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 LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int 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;
typedef vector<pii> vp;

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

bool g(int x, vi a){
    if(x >= 8){
        if(a[8]%3 || a[9]%3)return false;
        return true;
    }
    rep(i,a[x]/3+1){
        vi t = a;
        t[x] -= i*3;
        if(t[x] <= t[x+1] && t[x] <= t[x+2]){
            t[x+1] -= t[x];
            t[x+2] -= t[x];
            t[x] = 0;
            if(g(x+1,t))return true;
        }
    }
    return false;
}

bool f(vi a){
    loop(i,1,10)if(a[i] >= 2){
        a[i] -= 2;
        if(g(1,a))return true;
        a[i] += 2;
    }
    return false;
}

signed main(void) {
    int n = 13;
    string s;
    while(cin >> s){
        vi a(10);
        rep(i,n)a[s[i]-'0']++;
        vi ans;
        loop(i,1,10)if(a[i] < 4){
            a[i]++;
            if(f(a))ans.push_back(i);
            a[i]--;
        }
        if(ans.size()){
            rep(i,ans.size()){
                cout << ans[i];
                if(i < ans.size()-1)cout << " ";
                else cout << endl;
            }
        }else{
            cout << 0 << endl;
        }
    }
}

