#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <atcoder/dsu>
#include <atcoder/segtree>
using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(int i=a;i<b;i++)
using vi = vector<int>; 
using vvi = vector<vi>; 
using li =vector<ll>;
using lli=vector<li>;
using si =vector<char>;
using ssi =vector<si>;
const long long INF = 1e18;
const long long MOD=1e9+7;
//for (auto [key, val] : mp)
long long modpow(long long a, long long n) {
    if (n == 0) return 1;
    long long half = modpow(a, n/2);
    long long res = half * half ;
    if (n & 1) res = res * a ;
    return res;
}
int main() { ll n;cin>>n;
li V2(n+1);
li V5(n+1);
rep(i,0,n+1)V2[i]=modpow(2,i);
rep(i,0,n+1)V5[i]=modpow(5,i);
li ans((n+1)*(n+1));
rep(i,0,n+1)rep(j,0,n+1){
	ans[i+j*(n+1)]=V2[i]*V5[j];
}
sort(ans.begin(),ans.end());
rep(i,0,(n+1)*(n+1))cout<<ans[i]<<endl;
}