def s(n):
	sum = 0
	for c in str(n):
		sum += int(c)
	return sum

def isSunuke(n):

	if n >= 10:
		sn = str(n)
		length = len(sn)
		nines = 0
		for c in sn:
			if c == "9":
				nines += 1
		if nines < length / 2:
			n += 1
			return False

	for m in range(n+1, n * 2):
		if m >= 10:
			sm = str(m)
			length = len(sm)
			nines = 0
			for c in sm:
				if c == "9":
					nines += 1
			if nines < length / 2:
				continue

		if (n / s(n)) > (m / s(m)):
			return False

	return True

k = int(input())
found=0
n = 1
while(found < k):

	if isSunuke(n):
		print(n)
		found +=1
		#n += (n//20)
	n += 1
