import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto S = RD!string;
	auto arr = new long[](13);
	foreach (i, c; S)
	{
		arr[i] = [c].to!long;
	}
	arr.sort();

	bool check(long x)
	{
		auto y = arr ~ x;
		y.sort();
		long[10] cnt;
		foreach (e; y)
		{
			++cnt[e];
		}
		bool all2 = true;
		foreach (e; cnt)
		{
			if (e > 4) return false;
			else if (e != 0 && e != 2)
			{
				all2 = false;
			}
		}
		if (all2) return true;

		foreach (i; 1..10)
		{
			if (cnt[i] < 2) continue;

			auto cnt2 = cnt.dup;
			cnt2[i] -= 2;

			foreach (k; 1..8)
			{
				if (cnt2[k] == 2)
				{
					if (cnt2[k+1] >= 2 && cnt2[k+2] >= 2)
					{
						if (cnt2[k+1] >= 3 || cnt2[k+2] >= 3)
						{
							cnt2[k] -= 2; cnt2[k+1] -= 2; cnt2[k+2] -= 2;
						}
					}
				}
 			}
			foreach_reverse (k; 3..10)
			{
				if (cnt2[k] == 2)
				{
					if (cnt2[k-1] >= 2 && cnt2[k-2] >= 2)
					{
						if (cnt2[k-1] >= 3 || cnt2[k-2] >= 3)
						{
							cnt2[k] -= 2; cnt2[k-1] -= 2; cnt2[k-2] -= 2;
						}
					}
				}
 			}

			foreach (j; 1..10)
			{
				if (cnt2[j] < 3) continue;
				
				cnt2[j] -= 3;
			}

			long k = 1;
			while (k < 8)
			{
				if (cnt2[k] >= 1)
				{
					if (cnt2[k+1] >= 1 && cnt2[k+2] >= 1)
					{
						--cnt2[k]; --cnt2[k+1]; --cnt2[k+2];
						continue;
					}
				}
				++k;
 			}
			
			bool ok = true;
			foreach (e; cnt2)
			{
				if (e != 0)
				{
					ok = false;
					break;
				}
			}
			if (ok) return true;
		}
		return false;
	}

	foreach (i; 1..10)
	{
		if (check(i))
			writeln(i);
	}

	stdout.flush();
	debug readln();
}