from math import gcd # import ham gcd - UCLN

a, b = map(int, input().split()) # nhap vao a, b
j = 0 # bien dem so

def check(n):
    reversed = int(str(n)[::-1]) # so dao nguoc
    if (gcd(reversed, n) == 1): # kiem tra neu gcd(so dao nguoc, n) = 1
        return 1 # tra ve gia tri 1
    else: return 0 # con lai tra ve gia tri 0

for i in range(a, b): # chay tu a den b
    if (check(i) == 1): j += 1 # neu check == 1 bien dem cong len
    else: continue # con lai bo qua
print(j) # in ra bien dem
# O(b - a)

 

from math import gcd

def check(n):

    return int(str(n)[::-1])

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

d = 0

for i in range(a, b + 1):

    if gcd(i, check(i)) == 1:

        d += 1

print(d)