#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(LL i = (l)    ; i <  (r); ++i)
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); ++i)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
template<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }
LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL >(v.size())
#define RF(e, v) for(auto & e: v)
#define ef else if
#define UR assert(false)

// ---- ----

bool tri(char a, char b, char c) {
	vector<char> v = { a, b, c };
	sort(ALL(v));
	a = v[0];
	b = v[1];
	c = v[2];
	if(a == b && b == c) { return true; }
	if(a + 1 == b && b + 1 == c) { return true; }
	return false;
}

bool f(string s) {
	map<char, int> mp;
	RF(e, s) { mp[e]++; if(mp[e] > 4) { return false; } }
	set<int> se;
	RF(e, mp) { se.insert(e.SE); }
	if(se == set<int>{ 2 }) { return true; }
	
	vector<bool> dp(1 << 14, false);
	inc(i, 14) {
	inc(j,  i) {
		if(s[i] == s[j]) { dp[(1 << i) | (1 << j)] = true; }
	}
	}
	inc(b, 1 << 14) {
		if(! dp[b]) { continue; }
		inc(i, 14) { if(bit(b, i)) { continue; }
		inc(j,  i) { if(bit(b, j)) { continue; }
		inc(k,  j) { if(bit(b, k)) { continue; }
			if(tri(s[i], s[j], s[k])) { dp[b | (1 << i) | (1 << j) | (1 << k)] = true; }
		}
		}
		}
	}
	
	return dp.back();
}

int main() {
	string s;
	cin >> s;
	
	inc1(i, 9) {
		string t = s;
		t += '0' + i;
		if(f(t)) { cout << i << endl; }
	}
	
	return 0;
}