#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <functional>
#include <cstring>
#include <regex>
#include <random>
#include <cassert>
#include <stack>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, s, n) for (int i = (s); i < (int)(n); i++)
#define revrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define revrepr(i, s, n) for (int i = (n) - 1; i >= s; i--)
#define debug(x) cerr << #x << ": " << x << "\n"
#define popcnt(x) __builtin_popcount(x)

const double PI = acos(-1.0);

using ll = long long;
using P = pair<int, int>;

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 T>
istream& operator >>(istream &is, vector<T> &v) {
    for (int i = 0; i < (int)v.size(); i++) cin >> v.at(i);
    return is;
}

template<class T, class U>
ostream& operator <<(ostream &os, pair<T, U> p) {
    cout << '(' << p.first << ", " << p.second << ')';
    return os;
}

template<class T>
void print(const vector<T> &v, const string &delimiter) { rep(i, v.size()) cout << (0 < i ? delimiter : "") << v.at(i); cout << endl; }

template<class T>
void print(const vector<vector<T>> &vv, const string &delimiter) { for (const auto &v: vv) print(v, delimiter); }

bool is_agari(const vector<int> &cnt) {
    repr(pr, 1, 10) {
        if (cnt[pr] < 2) continue;

        //bit[i] = 1 => (i, i, i) を使う
        rep(bit, 1 << 9) {
            vector<int> c = cnt;
            
            c[pr] -= 2;
            bool ok = true;
            
            repr(i, 1, 10) if (bit >> (i - 1) & 1) {
                if (3 <= c[i]) c[i] -= 3;
                else ok = false;
            }
            if (!ok) continue;
            
            int cnt_seq = 0;
            repr(i, 1, 8) {
                int min_cnt = 4;
                rep(j, 3) chmin(min_cnt, c[i + j]);
                if (1 <= min_cnt) {
                    cnt_seq += min_cnt;
                    rep(j, 3) c[i + j] -= min_cnt;
                }
            }
            
            if (ok && 4 <= cnt_seq + popcnt(bit)) {
                /*cout << "can make 1" << endl;
                cout << bitset<10>(bit) << endl;
                repr(i, 1, 10) cout << i << ":" << c[i] << " ";
                cout << endl;*/
                return true;
            }
        }
    }
    
    int cnt_pr = 0;
    repr(i, 1, 10) if (2 <= cnt[i]) cnt_pr++;
    if (7 <= cnt_pr) {
        //cout << "can make 2" << endl;
        return true;
    }
    
    return false;
}

int main() {
    string s;
    cin >> s;
    vector<int> cnt(10);
    rep(i, s.size()) cnt[s[i] - '0']++;
    
    repr(i, 1, 10) {
        if (cnt[i] == 4) continue;
        cnt[i]++;
        if (is_agari(cnt)) cout << i << endl;
        cnt[i]--;
    }
}