# frozen_string_literal: true

def read
  gets.to_i
end

def solve(n)
  Enumerator.new { |y|
    cands = candidates(10**15)
    n = 0
    loop do
      n = cands.select { |i| i > n }.min_by { |i| n_s(i) }
      y << n
    end
  }.take(n)
end

def candidates(n)
  digits = n.succ.to_s.chars.map(&:to_i).reverse
  digits.zip(0..Float::INFINITY).flat_map do |d, p|
    (d...10).map { |c| (c + 1) * 10**p - 1 }
  end
end

def n_s(n)
  Rational(n, n.to_s.chars.map(&:to_i).reduce(:+))
end

puts solve(read)
