#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;
    }
}

bool solve(vector<int> v) {
    int zerocnt = count(v.begin(), v.end(), 0);
    if(zerocnt == 8) return true;
    rep(i,0,9) {
        if(v[i] >= 3) {
            v[i] -= 3;
            if(solve(v)) return true;
            v[i] += 3;
        }
    }
    rep(i,0,7) {
        if(v[i] >= 1 && v[i+1] >= 1 && v[i+2] >= 1) {
            v[i]--; v[i+1]--; v[i+2]--;
            if(solve(v)) return true;
            v[i]++; v[i+1]++; v[i+2]++;
        }
    }
    return false;
}

signed main() {
    string s;
    while(cin >> s) {
        vector<int> v(9, 0);
        bool invalid = false;
        rep(i,0,s.length()) {
            v[ s[i] - '1' ]++;
            if(v[ s[i] - '1' ] > 4) invalid = true;
        }
        if(invalid) cout << 0 << endl;
        else {
            vector<int> ans;
            rep(i,0,9) {
                if(v[i] == 4) continue;
                v[i]++;
                if(solve(v)) ans.pb(i+1);
                v[i]--;
            }

            bool find = false;
            if(ans.size()) {
                rep(i,0,ans.size()) {
                    if(find) printf(" %lld", ans[i]);
                    else printf("%lld", ans[i]);
                    find = true;
                }
                cout << endl;
            }
            else cout << 0 << endl;
        }
    }
    return 0;
}