№23 — #23150

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
@lru_cache(None)
def f(n, has16=False, has64=False, bused=False):
    if n == 2:
        return 1 if (has16 ^ has64) and bused else 0
    if n < 2:
        return 0
ans = 0
    ans += f(n - 1, has16 or n - 1 == 16, has64 or n - 1 == 64, bused)
if is_square(n):
        x = int(math.isqrt(n))
        if x < n:
            ans += f(x, has16 or x == 16, has64 or x == 64, True)
r = cube_root_int(n)
    if r is not None and r < n:
        ans += f(r, has16 or r == 16, has64 or r == 64, bused)
x = n // 2 if n % 2 == 0 else n - 3
    if x < n and x >= 1:
        ans += f(x, has16 or x == 16, has64 or x == 64, bused)
if n > 9:
        x = n // 10
        ans += f(x, has16 or x == 16, has64 or x == 64, bused)
return ans
raw = f(256)
digits = sorted(map(int, str(raw)), reverse=True)
print(digits[0] + digits[1])