#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main(){
    ll n;
    cin >> n;
    ll N = pow(10, n);
    vector<ll> v = {1, 2, 5, 10};
    vector<ll> u = {1, 2, 5, 10};
    for(int i=0; i<n; i++){
        int sz = v.size();
        for(auto x: u){
            for(int j=0; j<sz; j++){
                ll tmp = v[j] * x;
                if(N % tmp == 0) v.push_back(tmp);
            }
        }
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    for(auto ans: v) cout << ans << endl;
    return 0;
}