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

int main(){
    vector <long long int> num(pow(19, 2), 0);
    long long tmp, i, max, p = 1;
    int N, cnt, cnt2 = 0;

    cin >> N;
    max = pow(10, N);
    tmp = max;
    cnt = pow(N + 1, 2) - 1;

    for(i = 1; i < max; i += p){
        if(tmp%i == 0){
            num[cnt2++] = i;
            if(i != tmp/i){
                num[cnt--] = tmp/i;
                max = tmp/i;
            }
        }
    }

    for(i = 0; i < pow(N + 1, 2); i++){
        cout << num[i] << endl;
    }

    return 0;
}