def solve(L, R):
    count = 0
 
    # For each digit (1 through 9) construct numbers where the first and last digits are the same
    for first_last_digit in range(1, 10):
        # Single-digit numbers
        if L <= first_last_digit <= R:
            count += 1
 
        # Multi-digit numbers where first and last digits are the same
        multiplier = 10  # Start with 10 and go higher (like 11, 101, 1001, ...)
        while True:
            num = first_last_digit * multiplier + first_last_digit
            if num > R:
                break
            if num >= L:
                count += 1
            multiplier *= 10  # Move to the next higher number structure
 
    return count
 
# Input
L = 47#int(input())
R = 74#int(input())
 
# Get the output
out_ = solve(L, R)
print(out_)
 

ZGVmIHNvbHZlKEwsIFIpOgogICAgY291bnQgPSAwCiAgICAKICAgICMgRm9yIGVhY2ggZGlnaXQgKDEgdGhyb3VnaCA5KSBjb25zdHJ1Y3QgbnVtYmVycyB3aGVyZSB0aGUgZmlyc3QgYW5kIGxhc3QgZGlnaXRzIGFyZSB0aGUgc2FtZQogICAgZm9yIGZpcnN0X2xhc3RfZGlnaXQgaW4gcmFuZ2UoMSwgMTApOgogICAgICAgICMgU2luZ2xlLWRpZ2l0IG51bWJlcnMKICAgICAgICBpZiBMIDw9IGZpcnN0X2xhc3RfZGlnaXQgPD0gUjoKICAgICAgICAgICAgY291bnQgKz0gMQogICAgICAgIAogICAgICAgICMgTXVsdGktZGlnaXQgbnVtYmVycyB3aGVyZSBmaXJzdCBhbmQgbGFzdCBkaWdpdHMgYXJlIHRoZSBzYW1lCiAgICAgICAgbXVsdGlwbGllciA9IDEwICAjIFN0YXJ0IHdpdGggMTAgYW5kIGdvIGhpZ2hlciAobGlrZSAxMSwgMTAxLCAxMDAxLCAuLi4pCiAgICAgICAgd2hpbGUgVHJ1ZToKICAgICAgICAgICAgbnVtID0gZmlyc3RfbGFzdF9kaWdpdCAqIG11bHRpcGxpZXIgKyBmaXJzdF9sYXN0X2RpZ2l0CiAgICAgICAgICAgIGlmIG51bSA+IFI6CiAgICAgICAgICAgICAgICBicmVhawogICAgICAgICAgICBpZiBudW0gPj0gTDoKICAgICAgICAgICAgICAgIGNvdW50ICs9IDEKICAgICAgICAgICAgbXVsdGlwbGllciAqPSAxMCAgIyBNb3ZlIHRvIHRoZSBuZXh0IGhpZ2hlciBudW1iZXIgc3RydWN0dXJlCgogICAgcmV0dXJuIGNvdW50CgojIElucHV0CkwgPSA0NyNpbnQoaW5wdXQoKSkKUiA9IDc0I2ludChpbnB1dCgpKQoKIyBHZXQgdGhlIG91dHB1dApvdXRfID0gc29sdmUoTCwgUikKcHJpbnQob3V0XykK