py66分真诚求调，好几天了

import math
def ispalindrome(x):
    x = str(x)
    n = len(x)//2
    for i in range(n+1):
        if x[i]==x[-1-i]:
            continue
        else:
            return False
    return True

def isprime(n):
    for i in range(2,int(math.sqrt(n))+1):
        if n%i==0:
            return False
        else:
            continue
    return True

a,b = map(int,input().split())
for i in range(a,b+1):
    if i%2==0:
        continue
    elif ispalindrome(i) and isprime(i):
        print(i)
    else:
        continue