#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>

using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>


ll cnt[10];
string s;
set<ll> ans;
int main() {
	cin >> s;
	REP(i, 13) {
		cnt[s[i] - '0']++;
	}
	REPO(i, 9) {
		if (cnt[i] == 4)continue;
		REPO(k, 9) {
			REP(sa, 1 << 9) {
				ll ncnt[10];
				bool ok = true, ti = true;
				REP(j, 10)ncnt[j] = cnt[j];
				ncnt[i]++;
				REPO(j, 9)if (ncnt[j] == 1 or ncnt[j] == 3 or ncnt[j] == 4)ti = false;
				if (ti) {
					ans.insert(i);
					break;
				}
				if (ncnt[k] < 2)continue;
				ncnt[k] -= 2;
				REP(j, 9) {
					if (sa & (1 << j))ncnt[j + 1] -= 3;
				}
				REPO(j, 7) {
					while (ncnt[j] > 0 and ncnt[j + 1] > 0 and ncnt[j + 2] > 0) {
						ncnt[j]--;
						ncnt[j + 1]--;
						ncnt[j + 2]--;
					}
				}

				REPO(j, 9) {
					if (ncnt[j] != 0) ok = false;
				}
				if (ok) {
					ans.insert(i);
					break;
				}
			}
		}
	}
	for (auto& i : ans) cout << i << endl;
}