№23 — #23159

from functools import lru_cache
def sum_digits(n):
    return sum(map(int, str(n)))
@lru_cache(None)
def f(n, has8=False, has32=False, last='', streak=0):
    if n == 128:
        return 1 if (has8 ^ has32) else 0
    if n > 128:
        return 0
ans = 0
    for cmd, x in [
        ('A', n + 2),
        ('B', n * 2),
        ('C', n * 4),
        ('D', n + 6),
        ('E', n + sum_digits(n))
    ]:
        ns = streak + 1 if cmd == last else 1
        if ns <= 2 and x <= 128:
            ans += f(x, has8 or x == 8, has32 or x == 32, cmd, ns)
return ans
raw = f(2)
digits = sorted(map(int, str(raw)), reverse=True)
print(digits[0] + digits[1])