№23 — #23143

from functools import lru_cache
import math
def is_square(n):
    r = int(math.isqrt(n))
    return r * r == n
def sum_digits(n):
    return sum(map(int, str(n)))
@lru_cache(None)
def f(n, has25=False, has47=False, last='', streak=0):
    if n == 3:
        return 1 if (has25 ^ has47) else 0
    if n < 3:
        return 0
ans = 0
    ans += f(n - 2, has25 or n - 2 == 25, has47 or n - 2 == 47, 'A', 1)
    ans += f(n - 3, has25 or n - 3 == 25, has47 or n - 3 == 47, 'B', 1)
x = n // 5
    if x < n:
        ans += f(x, has25 or x == 25, has47 or x == 47, 'C', 1)
if is_square(n):
        x = int(math.isqrt(n))
        if x < n:
            ans += f(x, has25 or x == 25, has47 or x == 47, 'D', 1)
if n > 9:
        ns = streak + 1 if last == 'E' else 1
        if ns <= 2:
            x = n // 10
            ans += f(x, has25 or x == 25, has47 or x == 47, 'E', ns)
return ans
raw = f(63)
print(sum_digits(raw) % 13)