#include <iostream>
#include <vector>
#include <algorithm>
typedef long long ll;
using namespace std;

int main() {
    int N;
    cin >> N;
    ll l = 1;
    for (int i = 0; i < N; i++) {
        l *= 10;
    }
    vector<ll> vc;
    for (ll i = 1; i * i <= l; i++) {
        if (l % i == 0) {
            vc.push_back(i);
            if (i * i != l) vc.push_back(l / i);
        }
    }
    sort(vc.begin(), vc.end());
    for (int i = 0; i < vc.size(); i++) cout << vc.at(i) << endl;   
    return 0;
}