#include using namespace std; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) typedef long long int ll; typedef unsigned long long ul; typedef long double ld; typedef vector vi; typedef vector vll; typedef vector vc; typedef vector vst; typedef vector vd; typedef vector vld; typedef pair P; template long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); } template auto min(const T& a){ return *min_element(a.begin(), a.end()); } template auto max(const T& a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template istream &operator>>(istream &is, pair &p){ is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const pair &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template istream &operator>>(istream &is, vector &v){ for(T &in : v) is >> in; return is; } template ostream &operator<<(ostream &os, const vector &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template ostream &operator<<(ostream &os, const map &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template ostream &operator<<(ostream &os, const set &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, const multiset &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, queue q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template ostream &operator<<(ostream &os, deque q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template ostream &operator<<(ostream &os, stack st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template ostream &operator<<(ostream &os, priority_queue pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template void inGraph(vector>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } namespace Rho{ unsigned long long mul(unsigned long long a, unsigned long long b, const unsigned long long mod) { long long ret = a * b - mod * (unsigned long long)(1.0L / mod * a * b); return ret + mod * (ret < 0) - mod * (ret >= (long long) mod); } bool rabin_miller(unsigned long long n){ switch(n){ case 0: // fall-through case 1: return false; case 2: return true; } if(n % 2 == 0) return false; vector A = {2, 325, 9375, 28178, 450775, 9780504, 1795265022}; unsigned long long s = 0, d = n - 1; while(d % 2 == 0){ s++; d >>= 1; } auto modpow = [](unsigned long long x, unsigned long long e, const unsigned long long mod) -> unsigned long long { unsigned long long ret = 1 % mod; x %= mod; while(e > 0){ if(e & 1) ret = mul(ret, x, mod); x = mul(x, x, mod); e >>= 1; } return ret; }; for(auto a : A){ if(a % n == 0) return true; unsigned long long t, x = modpow(a, d, n); if(x != 1){ for(t = 0; t < s; ++t){ if(x == n - 1) break; x = mul(x, x, n); } if(t == s) return false; } } return true; } mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); unsigned long long FindFactor(unsigned long long n) { if(n == 1 || rabin_miller(n)) return n; if(n % 2 == 0) return 2; unsigned long long c = 1, x = 0, y = 0, t = 0, prod = 2, x0 = 1, q; auto f = [&](unsigned long long X) { return mul(X, X, n) + c;}; while (t++ % 128 or __gcd(prod, n) == 1) { if(x == y) c = rng() % (n-1) + 1, x = x0, y = f(x); if((q = mul(prod, max(x, y) - min(x, y), n))) prod = q; x = f(x), y = f(f(y)); } return __gcd(prod, n); } vector factorize(unsigned long long x) { if(x == 1) return {}; unsigned long long a = FindFactor(x), b = x / a; if(a == x) return {a}; vector L = factorize(a), R = factorize(b); L.insert(L.end(), R.begin(), R.end()); return L; } vector divisor(unsigned long long x){ vector factor = Rho::factorize(x); map countFactor; for(auto x : factor){ if(countFactor.count(x) == 0) countFactor[x] = 0; countFactor[x]++; } vector ret = {1}; for(auto [x, cnt] : countFactor){ int n = ret.size(); for(int i = 0; i < n; ++i){ unsigned long long z = ret[i]; for(int j = 0; j < cnt; ++j){ z *= x; ret.push_back(z); } } } return ret; } } template T intpow(T x, int n){ T ret = 1; while(n > 0) { if(n & 1) (ret *= x); (x *= x); n >>= 1; } return ret; } ll n; void input(){ in(n); } void solve(){ vector
    div = Rho::divisor(intpow(10LL, n)); Sort(div); vout(div); } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); input(); solve(); }