#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;

typedef long long ll;

int main() {
	int N; cin >> N;

	vector<ll>ans;
	for (int i = 0; i <= N; i++) {
		for (int j = 0; j <= N; j++) {
			ans.push_back(pow(2, i) * pow(5, j));
		}
	}
	
	sort(ans.begin(), ans.end());

	for (int i = 0; i < ans.size(); i++) {
		cout << ans[i] << endl;
	}

	return 0;
}