#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<random>
#include<unordered_map>
using namespace std;
//---------------------------------------------------
//ライブラリゾーン！！！！
#define int long long
#define str string
#define rep(i,j) for(int i=0;i<(int)(j);i++)
typedef long long ll;
typedef long double ld;
const ll inf = 4523372036854775807;
short gh[2][4] = { {0,0,-1,1},{-1,1,0,0} };
struct P {
ll pos, cost;
};
bool operator<(P a, P b) { return a.cost < b.cost; }
bool operator>(P a, P b) { return a.cost > b.cost; }
struct B {//隣接リスト表現
ll to, cost;
};
struct S {//辺の情報を入れる変数
int from, to, cost;
};
struct H {
int x, y;
};
bool operator<(H a, H b) {
if (a.x != b.x) return a.x < b.x;
return a.y < b.y;
}
ll gcm(ll i, ll j) {//最大公約数
if (i > j) swap(i, j);
if (i == 0) return j;
return gcm(j%i, i);
}
ld rad(ld a, ld b, ld c, ld d) {
return sqrt(pow(a - c, 2) + pow(b - d, 2));
}//rad＝座標上の2点間の距離
int ari(int a, int b, int c) {
return (a + b)*c / 2;
}//等差数列の和
bool suf(ld a, ld b, ld c, ld d) {
if (b <= c || d <= a) return 0;
return 1;
}//[a,b),[c,d)
//---------------------------------------------------
//+++++++++++++++++++++++++++++++++++++++++++++++++++
int b[10],c[10];
bool solve(int x,int y){
	if(x==4&&y==1){
		return 1;
	}
	bool ans=0;
	if(x<4){
		for(int i=1;i<=7;i++){
			if(c[i]&&c[i+1]&&c[i+2]){
				c[i]--;c[i+1]--;c[i+2]--;
				ans=ans||solve(x+1,y);
				c[i]++;c[i+1]++;c[i+2]++;
			}
		}
		for(int i=1;i<=9;i++){
			if(c[i]>=3){
				c[i]-=3;
				ans=ans||solve(x+1,y);
				c[i]+=3;
			}
		}
	}
	if(y<1){
		for(int i=1;i<10;i++){
			if(c[i]>=2){
				c[i]-=2;
				ans=ans||solve(x,y+1);
				c[i]+=2;
			}
		}
	}
	return ans;
}
signed main() {
	string s;
	while(cin>>s){
		for(int i=0;i<10;i++)
			b[i]=0;
		vector<int>a;
		for(int i=0;i<13;i++){
			b[(int)s[i]-'0']++;
		}
		for(int i=1;i<=9;i++){
			if(b[i]>=5){
				cout<<0<<endl;
				return 0;
			}
			if(b[i]==4){
				continue;
			}
			for(int j=0;j<10;j++)
				c[j]=b[j];
			c[i]++;
			if(solve(0,0)){
				a.push_back(i);
			}
		}
		if(a.size()==0){
			cout<<0<<endl;
		}
		else{
			for(int i=0;i<a.size();i++){
				if(i==0) cout<<a[i];
				else cout<<" "<<a[i];
			}
			cout<<endl;
		}
	}
	getchar(); getchar();
}

