#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def IR(n):
    return [I() for _ in range(n)]
def LIR(n):
    return [LI() for _ in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    n = int(input(),16)
    cnt = defaultdict(lambda: 0)
    x = list(map(int,oct(n)[2:]))
    for i in x:
        cnt[i] += 1
    cnt = list(cnt.items())
    cnt.sort(key=lambda x:(-x[1],x[0]))
    m = cnt[0][1]
    ans = [x for x,y in cnt if y == m]
    print(*ans)
    return


if __name__ == "__main__":
    solve()