#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
using namespace std;
typedef long long int ll;
using ull = unsigned long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<ll> v,vv;
    vector<ll> res;
    ll p=1,pp=1;
    for(int i=0;i<=n;i++){
        v.push_back(p);
        vv.push_back(pp);
        p*=2;
        pp*=5;
    }
    for(int i=0;i<=n;i++){
        for(int j=0;j<=n;j++){
            res.push_back(v[i]*vv[j]);
        }
    }
    sort(res.begin(), res.end());
    for(ll d:res){
        printf("%lld\n",d);
    }
}