№23 — #23152

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, has48=False, has12=False):
    if n == 3:
        return 1 if (has48 ^ has12) else 0
    if n < 3 or n == 24:
        return 0
ans = 0
    ans += f(n - 2, has48 or n - 2 == 48, has12 or n - 2 == 12)
    ans += f(n - 5, has48 or n - 5 == 48, has12 or n - 5 == 12)
x = n // 3
    if x < n:
        ans += f(x, has48 or x == 48, has12 or x == 12)
if is_square(n):
        x = int(math.isqrt(n))
        if x < n:
            ans += f(x, has48 or x == 48, has12 or x == 12)
if n > 9:
        x = n // 10
        ans += f(x, has48 or x == 48, has12 or x == 12)
return ans
raw = f(144)
print(sum_digits(raw) ** 2)