#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr int MOD = 1000000007;

int n;
vector<ll> diviser;

void dfs(int i,ll now){
    if(i==2) diviser.push_back(now);
    else if(i==0){
        ll two = 1;
        dfs(i+1,two*now);
        rep(j,n){
            two *= 2;
            dfs(i+1,now*two);
        }
    }else if(i==1){
        ll five = 1;
        dfs(i+1,five*now);
        rep(j,n){
            five *= 5;
            dfs(i+1,now*five);
        }
    }
}

int main(){
    cin >> n;
    dfs(0,1);
    sort(diviser.begin(),diviser.end());
    for(ll p:diviser) cout << p << endl ;
    return 0;
}