import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

def ok(i=0, head=False):
    if i == 9: return True
    if cnt[i] == 0: return ok(i+1, head)
    if cnt[i] > 1 and not head:
        cnt[i] -= 2
        if ok(i, True): return True
        cnt[i] += 2
    if cnt[i] > 2:
        cnt[i] -= 3
        if ok(i, head): return True
        cnt[i] += 3
    if i+2 < 9 and cnt[i] and cnt[i+1] and cnt[i+2]:
        cnt[i] -= 1
        cnt[i+1] -= 1
        cnt[i+2] -= 1
        if ok(i, head): return True
        cnt[i] += 1
        cnt[i+1] += 1
        cnt[i+2] += 1
    return False

s = BI()
cnt_ori = [0]*9
for c in s: cnt_ori[c-49] += 1

ans = []
for i in range(9):
    if cnt_ori[i] == 4: continue
    cnt = cnt_ori[:]
    cnt[i] += 1
    if cnt.count(2) == 7 or ok(): ans.append(i+1)

print(*ans, sep="\n")