#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }


string str;
set<vint> se;

int main() {
    se.clear();
    
    int j[4];
    for (int i = 1; i <= 9; ++i) {
        for (j[0] = 1; j[0] <= 16; ++j[0]) {
            for (j[1] = 1; j[1] <= 16; ++j[1]) {
                for (j[2] = 1; j[2] <= 16; ++j[2]) {
                    for (j[3] = 1; j[3] <= 16; ++j[3]) {
                        vint tmp(9, 0);
                        tmp[i-1] = 2;
                        for (int k = 0; k < 4; ++k) {
                            if (j[k] <= 9) tmp[j[k]-1] += 3;
                            else {
                                tmp[j[k]-10]++;
                                tmp[j[k]-9]++;
                                tmp[j[k]-8]++;
                            }
                        }
                        bool check = true;
                        for (int l = 0; l < 9; ++l) if (tmp[l] > 4) check = false;
                        if (check) se.insert(tmp);
                    }
                }
            }
        }
    }
    
    while (cin >> str) {
        vint vec(9, 0);
        for (int i = 0; i < str.size(); ++i) vec[ str[i]-'1' ]++;
        vint res;
        for (int add = 1; add <= 9; ++add) {
            vint tmp = vec;
            tmp[add-1]++;
            if (se.count(tmp)) res.PB(add);
        }
        
        if (res.size() == 0) cout << "0";
        else {
            for (int i = 0; i < res.size(); ++i) {
                cout << res[i];
                if (i != res.size()-1) cout << " ";
            }
        }
        cout << endl;
    }
    
    return 0;
}
