#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 9999999

using namespace std;

typedef pair<int, int> P;

int dy[4] = { 0,0,1,-1 };
int dx[4] = { 1,-1,0,0 };
long long c[100000];

int main() {
	int n;
	cin >> n;
	long long two[20], five[20];
	two[0] = 1; five[0] = 1;
	REP(i, n) {
		two[i + 1] = two[i] * 2;
		five[i + 1] = five[i] * 5;
	}
	int k = 0;
	REP(i, n+1) {
		REP(j, n+1) {
			c[k] = two[i] * five[j];
			k++;
		}
	}
	int N = (n + 1)*(n + 1);
	SORT(c, N);
	REP(i, N) {
		cout << c[i] << endl;
	}
}