#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

int main() {
  string S;
  cin >> S;

  int c[9] = {};
  for(auto &p : S) c[p - '1']++;

  for(int i = 0; i < 9; i++) {
    if(c[i] == 4) continue;
    S += (char) (i + '1');
    c[i]++;
    vector< int > dp(1 << S.size());
    for(int j = 0; j < S.size(); j++) {
      for(int k = j + 1; k < S.size(); k++) {
        if(S[j] == S[k]) {
          dp[(1 << j) | (1 << k)] = true;
        }
      }
    }
    for(int j = 0; j < (1 << S.size()); j++) {
      if(!dp[j]) continue;
      for(int k = 0; k < S.size(); k++) {
        if((j >> k) & 1) continue;
        for(int l = 0; l < k; l++) {
          if((j >> l) & 1) continue;
          for(int m = 0; m < l; m++) {
            if((j >> m) & 1) continue;
            vector< int > uku{S[k], S[l], S[m]};
            sort(begin(uku), end(uku));
            if(uku[0] == uku[2] && uku[0] == uku[1]) {
              dp[j | (1 << k) | (1 << l) | (1 << m)] |= dp[j];
            }
            if(uku[0] + 1 == uku[1] && uku[1] + 1 == uku[2]) {
              dp[j | (1 << k) | (1 << l) | (1 << m)] |= dp[j];
            }
          }
        }
      }
    }
    bool ok = false;
    ok |= dp.back();
    for(int j = 0; j < 1 << 9; j++) {
      if(__builtin_popcount(j) != 7) continue;
      bool check = true;
      for(int k = 0; k < 9; k++) {
        if((j >> k) & 1) check &= c[k] == 2;
      }
      ok |= check;
    }
    if(ok) {
      cout << i + 1 << endl;
    }
    c[i]--;
    S.pop_back();
  }
}