№23 — #23146

from functools import lru_cache
import math
def is_square(n):
    r = int(math.isqrt(n))
    return r * r == n
def cube_root_int(n):
    r = round(n ** (1 / 3))
    while (r + 1) ** 3 <= n:
        r += 1
    while r ** 3 > n:
        r -= 1
    return r if r ** 3 == n else None
def sum_digits(n):
    return sum(map(int, str(n)))
@lru_cache(None)
def f(n, has27=False, has64=False, last='', streak=0):
    if n == 1:
        return 1 if (has27 ^ has64) else 0
    if n < 1:
        return 0
ans = 0
    moves = [('A', n - 1)]
if is_square(n):
        x = int(math.isqrt(n))
        if x < n:
            moves.append(('B', x))
r = cube_root_int(n)
    if r is not None and r < n:
        moves.append(('C', r))
x = n // 2 if n % 2 == 0 else n - 2
    if x >= 1 and x < n:
        moves.append(('D', x))
if n > 9:
        x = n // 10
        if x < n:
            moves.append(('E', x))
for cmd, nxt in moves:
        ns = streak + 1 if cmd == last else 1
        if ns <= 2:
            ans += f(nxt, has27 or nxt == 27, has64 or nxt == 64, cmd, ns)
return ans
raw = f(729)
print(sum_digits(raw) % 11)