#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

signed main() {
    string s;
    while(cin >> s) {
        int num[9] = {};
        vector<int> v;

        bool invalid = false;
        rep(i,0,s.length()) {
            num[ s[i] - '0' - 1 ]++;
            if(num[ s[i] - '0' - 1 ] > 4) invalid = true;
        }
        if(invalid) {
            cout << 0 << endl;
            break;
        }

        rep(i,0,9) {
            int temp[9];
            bool ok = false;
            rep(j,0,9) {
                rep(k,0,1 << 7) {
                    if(__builtin_popcount(k) > 4) continue;
                    int cnt = 0;
                    rep(l,0,9) temp[l] = num[l];
                    temp[i]++;
                    if(temp[i] > 4) continue;
                    if(ok) continue;
                    if(temp[j] < 2) continue;
                    temp[j] -= 2;
                    
                    bool ok2 = true;
                    rep(l,0,7) {
                        if((k >> l) & 1) {
                            int mi = INF;
                            rep(m,0,3) mi = min(mi, temp[l+m]);
                            if(mi == 0) ok2 = false;
                            rep(m,0,3) temp[l+m] -= mi;
                            if(ok2) cnt += mi;
                        }   
                    }

                    rep(l,0,9) {
                        if(temp[l] >= 3) {
                            temp[l] -= 3;
                            cnt++;
                        }
                        else if(temp[l] != 0) ok2 = false;
                    }

                    if(!ok2) continue;
                    // printf("num = %lld, cnt = %lld\n", i, cnt);
                    if(cnt == 4) {
                        ok = true;
                        v.pb(i+1);
                    }
                }
            }
        }
        if(v.size() != 0) {
            rep(i,0,v.size()) {
                if(i != 0) printf(" %lld", v[i]);
                else printf("%lld", v[i]);
            }
            cout << endl;
        }
        else cout << 0 << endl;
    }
    return 0;
}