#include<iostream>
#include<algorithm>
#include<string>
#include<math.h>
#include<bitset>
#include <vector>
#include<bitset>
#include <iomanip>
#include <map>
#include <set>
#include <stack>
#include <deque>
#include <climits>
#include <queue>
using namespace std;

int main() {
	int N;
	cin >> N;
	priority_queue<long long, vector<long long>, greater<long long >> Q;
	for (int i = 0; i <= N; i++) {
		for (int j = 0; j <= N; j++) {
			long long D = pow(2, i) * pow(5, i);
			Q.push(D);
		}
	}
	while (Q.size() > 0) {
		cout << Q.top() << endl;
		Q.pop();
	}




}