#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
	int N;
	cin >> N;
	vector<long long> A(N + 1);
	A[0] = 1;
	for (int i = 0; i < N; i++){
		A[i + 1] = A[i] * 2;
	}
	vector<long long> B(N + 1);
	B[0] = 1;
	for (int i = 0; i < N; i++){
		B[i + 1] = B[i] * 5;
	}
	vector<long long> F;
	for (int i = 0; i <= N; i++){
		for (int j = 0; j <= N; j++){
			F.push_back(A[i] * B[j]);
		}
	}
	sort(F.begin(), F.end());
	int cnt = F.size();
	for (int i = 0; i < cnt; i++){
		cout << F[i] << endl;
	}
}