from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

A = list(map(int, input().split()))
ans = []
for n in range(1, 10):
    B = A + [n]
    C = Counter(B)
    t = 0
    o = 0
    for c in C:
        if C[c] == 3: t += 1
        if C[c] == 2: o += 1
    if t == 4 and o == 1:
        ans.append(n)
print(len(ans))
printl(ans)