import bisect

K = int(input())
num = 1
limit = 10000
insert_index = 0
count = 0

sunuke_div = []
sunuke_num = []

while count < K:
    num_ = str(num)
    Sn = 0
    for n in num_:
        Sn += int(n)
    sunuke = num/Sn
    pre_insert_index = insert_index
    insert_index = bisect.bisect_right(sunuke_div, sunuke)
    sunuke_div.insert(insert_index, sunuke)
    sunuke_num.insert(insert_index, num)
    if pre_insert_index < insert_index:
        print(num-1)
        count += 1
    num += 1
