#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define R cin>>
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

int a[10];

bool solve(int x,int y, int z) {
  if(x==10) return (y==1&&z==4);
  if(!a[x]) return solve(x+1,y,z);
  bool ck=false;
  if(a[x]>=3) {
    a[x]-=3;
    if(solve(x,y,z+1)) ck=true;
    a[x]+=3;
  }
  if(ck) return ck;
  if(a[x]>=2 && !y) {
    a[x]-=2;
    if(solve(x,1,z)) ck=true;
    a[x]+=2;
  }
  if(ck) return ck;
  if(x<=7 && a[x] && a[x+1] && a[x+2]) {
    a[x]--,a[x+1]--,a[x+2]--;
    if(solve(x,y,z+1)) ck=true;
    a[x]++,a[x+1]++,a[x+2]++;
  }
  return ck;
}

int main() {
  string s;
  while(R s) {
    memset(a,0,sizeof(a));
    rep(i,s.size()) a[s[i]-'0']++;
    vector<int> ans;
    REP(i,1,10) {
      if(a[i]>=4) continue;
      a[i]++;
      if(solve(1,0,0)) ans.pb(i);
      a[i]--;
    }
    if(ans.size()) {
      rep(i,ans.size()) {
	if(i) cout << " ";
	cout << ans[i];
      }
      cout << endl;
    } else pr(0);
  }
  return 0;
}
