#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(ll i=(n);i<(m);i++)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) for(ll i=(n);i>=0;i--)
#define all(vec) vec.begin(),vec.end()
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using PP=pair<ll,P>;
using vp=vector<P>;
using vpp=vector<PP>;
using vs=vector<string>;
#define fi first
#define se second
#define pb push_back
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
const ll MOD=1000000007LL;
const int INF=1<<30;
const ll LINF=1LL<<60;
ll pow10(int x){
    ll res=1;
    REP(i,x){
        res*=10;
    }
    return res;
}
int f(ll x){
    int res=0;
    while(x){
        res+=x%10;
        x/=10;
    }
    return res;
}
double calc(ll x){
    return (double)x/f(x);
}
int main(){
    int n;
    cin>>n;
    vl vec;
    REPR(i,15){
        REPR(j,999){
            if(!j){
                continue;
            }
            ll p=j*pow10(i)-1;
            vec.pb(p);
        }
    }
    sort(all(vec));
    vec.erase(unique(all(vec)),vec.end());
    set<ll> se;
    double mi=1e18;
    REPR(i,vec.size()-1){
        if(mi>=calc(vec[i])){
            mi=calc(vec[i]);
            se.insert(vec[i]);
        }
    }
    for(auto itr:se){
        if(!n){
            break;
        }
        n--;
        cout<<itr<<endl;
    }
    return 0;
}