#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    ll n;
    cin >> n;

    ll a[n+1];
    ll b[n+1];
    rep(i,n+1){
        if(i == 0){
            a[i] = 1;
            b[i] = 1;
        }else{
            a[i] = a[i-1] * 2;
            b[i] = b[i-1] * 5;
        }
    }

    vector<ll> v;
    rep(i,n+1){
        rep(j,n+1){
            v.push_back(a[i] * b[j]);
        }
    }
    sort(v.begin(), v.end());
    rep(i,v.size())cout << v[i] << endl;
    
    return 0;
}