// yukicoder: No.677 10^Nの約数
// 2019.4.13 bal4u

#include <stdio.h>

//// 高速入力
#if 0
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in()    // 非負整数の入力
{
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

void out(long long n)  // 正整数の表示（出力）
{
	int i;
	char b[40];

	i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
	while (i--) pc(b[i]);
	pc('\n');
}

#define MAX  400
int sz;
long long tbl[MAX];
int pow[MAX][2];
int factor[2] = { 2, 5 };

int main(void)
{
	int i, j, k, p, q, N;
	long long d, min, ugly;

	N = in();
	sz = (N + 1)*(N + 1);
	ugly = tbl[0] = 1, pow[0][0] = pow[0][1] = 0;
	for (k = 1; k < sz; k++) {
		min = 0;
		for (i = 0; i < k; i++) {
			for (j = 0; j < 2; j++) {
				if (pow[i][j] == N) continue;
				d = tbl[i] * factor[j];
				if (d > ugly && (min == 0 || d < min)) min = d, p = i, q = j;
			}
		}
		tbl[k] = ugly = min;
		pow[k][0] = pow[p][0] + (q == 0);
		pow[k][1] = pow[p][1] + (q == 1);
	}
	for (i = 0; i < sz; i++) out(tbl[i]);
	return 0;
}