#include <bits/stdc++.h>

#define SIZE 300005
#define MOD 1000000007LL
#define INF 1 << 30
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define FORALL(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define FOREACH(i,c) for(auto (i) : (c))
#define BIT(i,j) ((i)>>(j))&1
#define ALL(o) (o).begin(), (o).end()
#define ERASE(o) (o).erase(unique((o).begin(),(o).end()), (o).end())
#define SQ(x) ((x)*(x))
using namespace std;
typedef long long ll;
typedef valarray<int> Array;
typedef pair<ll,ll> Pll;
typedef pair<int, int> Pii;
typedef pair<double, double> Pdd;
template<typename T> inline void priv(vector<T>a){REP(i,a.size()){cout<<a[i]<<((i==a.size()-1)?"\n":" ");}}
int gcd(int a,int b){int c=max(a,b);int d=min(a,b);return c==0||d==0?c:gcd(c%d,d);}
int lcm(int a,int b){return a==0||b==0?0:a*b/gcd(a,b);}

bool dfs(vector<int> a)
{
  if(accumulate(a.begin(),a.end(),0) == 2)
  {
    REP(i,9) if(a[i] == 2) return true;
    return false;
  }
  REP(i,9)
  {
    if(a[i] == 0) continue;
    if(a[i] >= 3)
    {
      a[i] -= 3;
      if(dfs(a)) return true;
      a[i] += 3;
    }
  }
  REP(i,7)
  {
    if(a[i]>0 && a[i+1]>0 && a[i+2]>0)
    {
      a[i]--;a[i+1]--;a[i+2]--;
      if(dfs(a)) return true;
      a[i]++;a[i+1]++;a[i+2]++;
    }
  }
  return false;
}

void solve(string s)
{
  vector<int> a(9,0);
  vector<int> ans;
  REP(i,s.size()) a[s[i]-'1']++;
  REP(i,9)
  {
    if(a[i] == 4) continue;
    a[i]++;
    if(dfs(a)) ans.push_back(i+1);
    a[i]--;
  }
  if(ans.empty()) cout << "0" << "\n";
  else priv(ans);
}

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  string s;
  while(cin >> s) solve(s);
  return 0;
}