#include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <sstream>
#include <string>
#include <vector>
using namespace std;

#define EPS 1e-9
#define INF MOD
#define MOD 1000000007LL
#define fir first
#define iss istringstream
#define sst stringstream
#define ite iterator
#define ll long long
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<n;i++)
#define pi pair<int,int>
#define pb push_back
#define sec second
#define sh(i) (1LL<<i)
#define sz size()
#define vi vector<int>
#define vc vector
#define vl vector<ll>
#define vs vector<string>

string s;

int f(map<int,int> M,int g){
	int r=0;
	if(g==0){
		rep2(i,1,10)if(M[i]>=2){
			map<int,int> N=M;
			N[i]-=2;
			r|=f(N,1);
		}
		return r;
	}
	int h=1;
	rep2(i,1,10)if(M[i])h=0;
	if(h)return 1;
	rep2(i,1,10)if(M[i]>=3){
		map<int,int> N=M;
		N[i]-=3;
		r|=f(N,1);
	}
	rep2(i,1,8)if(M[i]&&M[i+1]&&M[i+2]){
		map<int,int> N=M;
		N[i]--,N[i+1]--,N[i+2]--;
		r|=f(N,1);
	}
	return r;
}

int main(){
	while(cin>>s){
		vi a;
		map<int,int> M;
		rep(i,13)M[s[i]-'0']++;
		rep2(i,1,10)if(M[i]<=3){
			map<int,int> N=M;
			N[i]++;
			if(f(N,0))a.pb(i);
		}
		if(a.sz==0)cout<<0<<endl;
		else rep(i,a.sz)cout<<a[i]<<(i<a.sz-1?" ":"\n");
	}
}