#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

bool rec(int p, vint no)
{
	if(p == 9)
	{
		rep(i, 9)
		{
			if(no[i]) return false;
			else if(i == 8) return true;
		}
	}

	int res = rec(p + 1, no);
	if(3 <= no[p])
	{
		vint v = no;
		v[p] -= 3;
		res |= rec(p + 1, v);
		if(v[p] == 1)
		{
			
			if(p < 7 && (v[p] <= v[p+1] && v[p] <= v[p+2]))
			{
				v[p+1] -= v[p];
				v[p+2] -= v[p];
				v[p]	= 0;

				res |= rec(p + 1, v);
			}
		}
	}

	if(p < 7)
	{
		if(no[p] <= no[p+1] && no[p] <= no[p+2])
		{
			no[p+1] -= no[p];
			no[p+2] -= no[p];
			no[p]	= 0;

			res |= rec(p + 1, no);
		}
	}

	return res;
}

int main()
{
	string str;
	while(cin >> str)
	{
		vint res;
		vint v(9, 0);

		rep(i, str.size())
			v[str[i] - '0' - 1]++;

		rep(num, 9) 
		{
			if(4 <= v[num]) continue;
			vint no = v;
			no[num]++;
			rep(i, 9)
			{
				if(2 <= no[i])
				{
					vint nn = no;
					nn[i] -= 2;
					if(rec(0, nn))
						res.push_back(num);
				}
			}
		}

		res.erase(unique(ALL(res)), res.end());

		if(res.size() == 0)
			cout << 0 << endl;
		else
		rep(i, res.size())
		{
			cout << res[i] + 1;
			if(i == res.size()-1)
				cout << endl;
			else
				cout << " ";
		}
	}
}