#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
#include<memory>
using namespace std;
using namespace std::chrono;
typedef long long int llint;
typedef double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/
const llint mod=1000000007;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
bool solve(string str){
	int cou[11]={0};
	for(auto c:str){cou[c-'0']++;}
	int i,j;
	for(i=1;i<=9;i++){
		if(cou[i]>4){return false;}
	}
	//七対子
	bool titoi=true;
	for(i=1;i<=9;i++){
		if(cou[i]!=0&&cou[i]!=2){titoi=false;}
	}
	
	if(titoi){return true;}
	for(int ata=1;ata<=9;ata++){
		if(cou[ata]<2){continue;}
		int now[13]={0};
		for(i=1;i<=9;i++){now[i]=cou[i];}
		now[ata]-=2;
		
		bool aga=true;
		for(i=1;i<=9;i++){
			now[i]%=3;
			if(now[i+1]<now[i]){aga=false;break;}
			now[i+1]-=now[i];
			if(now[i+2]<now[i]){aga=false;break;}
			now[i+2]-=now[i];
		}
		if(aga){return true;}
		
	}
	return false;
}
int main(void){
	string str;cin>>str;
	for(int i=1;i<=9;i++){
		str.pub('0'+i);
		if(solve(str)){cout<<i<<endl;}
		str.pob();
	}
	return 0;
}