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

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

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