#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

int arr[10] = {};

bool dfs(int n) {
    if (n == 10) {
        return true;
    }
    if (arr[n] == 0) return dfs(n + 1);
    if (arr[n] >= 3) {
        arr[n] -= 3;
        bool res = dfs(n);
        arr[n] += 3;
        if (res) return true;
    }
    if (arr[n] >= 1 && n <= 7) {
        REP(i, 0, 3) {
            arr[n + i]--;
        }
        bool res = dfs(n);
        REP(i, 0, 3) {
            arr[n + i]++;
        }
        if (res) return true;
    }
    return false;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string s;
    cin, s;
    REP(i, 0, s.size()) {
        arr[s[i] - '0']++;
    }
    REP(j, 1, 10) {
        if (arr[j] == 4) continue;
        arr[j]++;
        bool check = false;
        REP(i, 1, 10) {
            if (arr[i] >= 2) {
                arr[i] -= 2;
                check |= dfs(1);
                arr[i] += 2;
                if (check) break;
            }
        }
        int cnt = 0;
        REP(i, 0, 10) {
            if (arr[i] == 2) {
                cnt++;
            }
        }
        if (check || cnt == 7) {
            print(j);
        }
        arr[j]--;
    }
    return 0;
}