import Data.Ratio
import Data.List

main = do
  k <- readLn :: IO Int

  mapM_ print $ take k $ snuke

  where
    snuke = [1..9] ++ (snuke' 10)
    snuke' :: Integer -> [Integer]
    snuke' n = x : (snuke' (x+1))
      where
        x = minimumBy (\a b -> compare (f a) (f b)) $ map (\d -> 10^(d+1) * floor((fromIntegral n) % (10^(d+1)) + 1) - 1) [0..(ceiling (logBase 10 (fromIntegral n)) + 1)]
        
    s n
      | n <= 9 = n
      | otherwise = (mod n 10) + s (div n 10)
    f n = (fromIntegral n) / (fromIntegral $ s n)
