#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,M,Q;
string s;

bool toomany(map<int,int> *M) {
    for (auto p:*M) {
        if (p.second > 4) return true;
    }
    return false;
}

bool is7tui(map<int,int> *M) {
    for (auto p:*M) {
        if (p.second != 0 && p.second != 2) return false;
    }
    return true;
}


bool zero(map<int,int> *M) {
    for (auto p:*M) {
        if (p.second != 0) return false;
    }
    return true;
}

bool check(map<int,int> M, int jt) {
    M[jt] -= 2;
    if (M[jt]<0) return false;
    FOR(t,1,10) {
        if (M[t]<0) break;
        while(M[t]>=3) M[t] -= 3;
        while(t<=7 && M[t]) {
            M[t]--;
            M[t+1]--;
            M[t+2]--;
        }
    }
    return (zero(&M));
}

bool ok(map<int,int> M, int n) {
    M[n]++;
    if (toomany(&M)) return false;
    if (is7tui(&M)) return true;
    FOR(jt,1,10) { // 雀頭
        if (check(M, jt)) return true;
    }
    return false;
}

void solve() {
    cin>>s;
    map<int, int> M;
    REP(i,13) {
        M[s[i]-'0']++;
    }
    vector<int> ans;
    FOR(n,1,10) {
        if (ok(M, n)) ans.push_back(n);
    }
    
    for (int n:ans) cout << n << endl;
}