#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>

using namespace std;



int main() {
	int i, j, k;
	int n;
	vector<long long>list;


	cin >> n;

	long long num, num2 = pow(10, n);
	num = num2;

	if (n == 0) {
		cout << 1 << endl;
		return 0;
	}

	while (true)
	{
		bool flag = false;

		for (long long i = 2; i <= num; i++) {
			if (num%i == 0) {
				num /= i;
				list.push_back(num);
				list.push_back(i);
				flag = true;
				break;
			}
		}
		if (flag == false) break;

	}

	map<long long, long long>mp;

	for (i = 0; i < list.size(); i++) {
		mp.insert(make_pair(list[i], 0));
	}

	/*
	for (i = 0; i < list.size(); i++) {
		for (j = i; j < list.size(); j++) {
			if (list[i] * list[j] <= num2) {
				mp.insert(make_pair(list[i] * list[j], 0));
			}

		}
	}*/

	while (true)
	{
		bool flag = false;

		for (auto itr = mp.begin(); itr != mp.end(); itr++) {
			for (auto itr2 = mp.begin(); itr2 != mp.end(); itr2++) {
				if ((*itr).first*(*itr2).first <= num2 && ( num2 % ((*itr).first*(*itr2).first) ) == 0) {
					if (mp.count((*itr).first*(*itr2).first) == 0) {
						mp.insert(make_pair((*itr).first*(*itr2).first, 0));
						flag = true;
						break;
					}
				}
			}
			if (flag == true)break;

		}

		if (flag == false)break;
	}

	for (auto itr = mp.begin(); itr != mp.end(); itr++) {

		cout << (*itr).first << endl;
	}


	getchar();
	getchar();
	return 0;
}