#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long int lint;
int main() {
	int N;
	cin >> N;
	int M = (N + 1) * (N + 1);
	vector<lint>vec(M);
	int cnt = 0;
	for (int ia = 0; ia <= N; ia++) {
		for (int ib = 0; ib <= N; ib++) {
			vec.at(cnt) = pow(2, ia) * pow(5, ib);
			cnt++;
		}
	}
	sort(vec.begin(), vec.end());
	int i = 0;
	for (int ic = 0; ic < M; ic++) {
		cout << vec.at(ic) << endl;
	}
}