#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int q(const int *a, const int *b)
{
	return *a - *b;
}

int main(void)
{
	long n, i, j = 0, a[100000], s, t = 0;
	scanf("%ld", &n);
	s = (long)pow(10, n);
	puts("1");
	for (i = 2; i <= s / 5; i += 2) {
		if (s % i == 0) {
			a[j] = i;
			j++;
		}
	}
	for (i = 5; i <= s / 2; i += 5) {
		if (s % i == 0) {
			a[j] = i;
			j++;
		}
	}
	qsort(a, j, 8, q);
	for (i = 0; i < j; i++) {
		if (t != a[i]) printf("%ld\n", a[i]);
		t = a[i];
	}
	printf("%ld", s);
	return 0;
}