№23 — #23147

from functools import lru_cache
def sum_digits(n):
    return sum(map(int, str(n)))
@lru_cache(None)
def f(n, has19=False, has36=False, eused=False):
    if n == 90:
        return 1 if (has19 ^ has36) and eused else 0
    if n > 90:
        return 0
ans = 0
    moves = [
        (n + 2, eused),
        (n + 4, eused),
        (n * 2, eused),
        (n * 3, eused),
        (n + sum_digits(n), True)
    ]
for nxt, flag in moves:
        if nxt <= 90:
            ans += f(nxt, has19 or nxt == 19, has36 or nxt == 36, flag)
return ans
raw = f(3)
digits = sorted(map(int, str(raw)), reverse=True)
print(digits[0] + digits[1])