请问这个枚举任务怎么解决 难度不高采纳率高。谢

def isPrime(n):
    for i in range(2, int(n **0.5) + 1):
        if n % i == 0:
            return False
    return True


a, b = map(int, input(">>>").split())

x = 0
for i in range(a, b + 1):
    if isPrime(i) and str(i)[::-1] == str(i):
        x += 1
        print(i, end=' ')
print(f"\n{x}",sep='' )