#include <bits/stdc++.h>

#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define pp pop_back
#define pf push_front
#define sqr(a) (a)*(a)
#define mpr(a,b) make_pair(a, b)
#define all(x) (x.begin(), x.end())
#define deb(x) cerr << #x << " = " << x << '\n'
#define N 222222

using namespace std;

typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mpii;
typedef map<string, int> mpsi;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef queue<int> qi;
typedef queue<ll> qll;
typedef queue<pair<int, int>> qpi;
typedef priority_queue<int> pqi;
typedef priority_queue<ll> pqll;
typedef priority_queue<pair<int,int>> pqpi;

const ld pi = 2 * acos(0.0);
template<class T> bool umin(T& a, T b){if(a>b){a=b;return 1;}return 0;}
template<class T> bool umax(T& a, T b){if(a<b){a=b;return 1;}return 0;}
template<class T> T gcd(T a, T b){return b ? gcd(b, a % b) : a;}
template<class T> T lcm(T a, T b){return a*(b/gcd(a,b));}
template<class T, class TT>bool pal(T a, TT n){int k=0;for(int i=0;i<=n/2;i++){if(a[i]!=a[n-i-1]){k=1;break;}}return k?0:1;}

//int month[] = {0, 31, 28, 31, 30, 31,30, 31, 31, 30, 31, 30, 31};

ll a[N*10];

int main()
{
	ll n;
	cin >> n;
	ll s= 1, cur = 1;
	if(n <= 18)
	{
		for(int i = 1; i <= n; i ++)
		{
			cout << cur << '\n';
			if(cur == 9)
				s = 10;
			cur += s;
		}
		return 0;
	}
	for(int i = 1; i <= 18; i ++)
		{
			cout << cur << '\n';
			if(cur == 9)
				s = 10;
			cur += s;
		}
	n -= 18;
	ll cnt = 0;
	string t = "99";
	ll r = 1;
	//while(1)
	{
		for(int i = r ; i <= r * 10 + 9; i ++)
		{
			cout << i;
			cout << t << '\n';
			cnt ++;
			if(cnt == n)
				break;
		}
		if(cnt == n)
			break;
		t += '9';
		r ++;
//		if(r % 10 ==0)
//			r +=9;
	}
	getchar();
	getchar();
	return 0;
	//freopen("Ganiyev.txt", "r", stdin);
	//freopen("Asadullo.txt", "w", stdout);
	//ios::sync_with_stdio(0);
	//cin.tie(0);cout.tie(0);
	
	
	
	
	
	
	
	
	
	
}
