№23 — #23142

from functools import lru_cache
import math
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, has60=False, has10=False, last='', streak=0):
    if n == 7:
        return 1 if (has60 or has10) else 0
    if n < 7 or n == 24:
        return 0
ans = 0
ns = streak + 1 if last == 'A' else 1
    if ns <= 3:
        ans += f(n - 1, has60 or n - 1 == 60, has10 or n - 1 == 10, 'A', ns)
r = int(math.isqrt(n))
    if r < n:
        ans += f(r, has60 or r == 60, has10 or r == 10, 'B', 1)
if n > 9:
        x = n // 10
        ans += f(x, has60 or x == 60, has10 or x == 10, 'C', 1)
x = n // 2 if n % 2 == 0 else n - 7
    if x < n and x >= 0:
        ans += f(x, has60 or x == 60, has10 or x == 10, 'D', 1)
r = cube_root_int(n)
    if r is not None and r < n:
        ans += f(r, has60 or r == 60, has10 or r == 10, 'E', 1)
return ans
raw = f(602)
digits = sorted(map(int, str(raw)), reverse=True)
print(digits[0] + digits[1])