require 'prime'

def divisor_list(x)
    return [] if x <= 0
    return [1] if x == 1

    x.prime_division.map{|e| [*(0..e.last)].map{|v| e.first ** v }}.inject{|res, e| res.map{|t| e.map{|v| t * v}}.flatten}.sort
end

n = gets.to_i
a = divisor_list(10 ** n)
puts a