#include "bits/stdc++.h"

#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}

void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}

bool CanContinuous(int i,vector<int>& n){
	if(i>=7) return false;
	if(n[i] && n[i+1] && n[i+2]) return true;
	return false;
}

bool DFS(vector<int>& n,int triplet,int twin){
	bool res = false;

	if(twin==1 && triplet==4) return true;

	for(int i=0;i<9;i++){
		if(n[i]>=3){
			n[i]-=3;
			res |= DFS(n,triplet+1,twin);
			n[i]+=3;
		}
		if(n[i]>=2 && !twin){
			n[i]-=2;
			res |= DFS(n,triplet,1);
			n[i]+=2;
		}
		if(n[i]>=1 && CanContinuous(i,n)){
			n[i]--;
			n[i+1]--;
			n[i+2]--;
			res |= DFS(n,triplet+1,twin);
			n[i]++;
			n[i+1]++;
			n[i+2]++;
		}
	}
	return res;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	string S;
	while(cin>>S){
		vector<int> num(9,0);
		REP(i,13){
			num[(S[i]-'0')-1]++;
		}
		vector<int> ans;
		REP(i,9){
			num[i]++;
			if(num[i]<=4 && DFS(num,0,0)){
				ans.push_back(i+1);
			}
			num[i]--;
		}

		if(ans.empty()){
			out(0);
		}
		else{
			for(int i=0,ei=ans.size();i<ei;i++){
				if(i) cout << ' ';
				cout << ans[i];
			}
			out();
		}
	}

	return 0;
}
