#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf = 1e9+7;

int N;
ll two[20];
ll five[20];
vector<ll> ans;
int main() {
    cin>>N;
    two[0]=1;
    five[0]=1;
    REP(i,1,N+1){
        two[i]=two[i-1]*2;
        five[i]=five[i-1]*5;
    }
    REP(i,0,N+1){
        REP(j,0,N+1){
            ans.push_back(two[i]*five[j]);
        }
    }
    sort(ans.begin(), ans.end());
    for(auto a: ans){
        p(a);
    }
    return 0;
}