#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <math.h>
#include <iomanip>
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;
const double pi = 3.141592653589793238;

int main() {
	int n;
	cin >> n;
	set<long long>s;
	for (int i = 0; i <= n; ++i) {
		for (int j = 0; j <= n; ++j) {
			s.insert(pow(2, i) * pow(5, j));
		}
	}
	for (auto i : s) { cout << i << endl; }
}