import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
#10**20,2**63に変えるのもあり
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    DecN = int(input(), 16)
    OctN = str(oct(DecN))[2:]
    #print(list(OctN))
    num = defaultdict(lambda:0)
    for o in list(OctN):
        num[int(o)]+=1
    MAX = max(list(num.values()))
    Ans = []
    for n in range(10):
        if num[n] == MAX:
            Ans.append(n)
    Ans.sort()
    print(*Ans)
    return
solve()