rs = reverse . show

solve :: (Integer, Integer) -> Int
solve (x, n) = length $ filter (<= n) kaibun where
    kaibun = concat $ map (\x -> map read [(show x) ++ rs x, (show x) ++ tail (rs x)]) [1..10^5]

main = readLn >>= print . solve. f where
    f x = (x, x `div` (10^9+1))