def parse(inFile):
    return tuple(inFile.getInts())

def rotate(n, k):
    v = str(n)
    v = "0" * (k - len(v)) + v
    return int(v[1:]+v[0])

def solve((A,B)):
    k = len(str(A))
    count = 0
    for n in xrange(A, B):
        m = rotate(n, k)
        while (m != n):
            if (n < m) and (m <= B):
                count += 1
            m = rotate(m, k)
    return count

if __name__ == "__main__":
    from GCJ import GCJ
    GCJ(parse, solve, "/Users/lpebody/gcj/2012_q/", "c").run()