#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(o) {cerr<<#o<<" "<<o<<endl;}
#define DUMPC(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

signed main() {
	for (string s; cin >> s;) {
		int d[12] = {};
		REP(i, s.size())d[s[i] - '0']++;
		string ans = "";
		FOR(x, 1, 10) {
			//DUMP(x);
			int e[12] = {};
			REP(i, 12)e[i] = d[i];
			e[x]++;
			if (*max_element(e, e + 10) <= 4) {
				//?????¢?????°???
				FOR(y, 1, 10) {
					int c[12] = {};
					REP(i, 12)c[i] = e[i];
					if (c[y] >= 2)c[y] -= 2;
					else continue;
					//DUMP(y)
					//DUMPC(c)
					//????????????????¶????
					FOR(z, 1, 10) {
						if (c[z] < 0) {
							break;
						}
						if (c[z] >= 3) {
							c[z] -= 3;
						}
						if (c[z] <= 2) {
							c[z + 1] -= c[z];
							c[z + 2] -= c[z];
							c[z] = 0;
						}
					}
					//DUMPC(c);
					if (*min_element(c, c + 12) == 0 && *max_element(c, c + 12) == 0) {
						ans += char(x + '0');
						ans += " ";
						break;
					}
				}
			}
		}
		if (ans == "") cout << 0 << endl; 
		else cout << ans.substr(0, ans.size() - 1) << endl;
	}
	return 0;
}