import java.util.Arrays;
import java.util.Scanner;

public class Main {
	long[][] comb = new long[3001][3001];
	long M;
	int N;

	void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int d2 = n;
		int d5 = n;
		long[] div = new long[(1 + n) * (1 + n)];
		for (int i = 0; i <= n; ++i) {
			for (int j = 0; j <= n; ++j) {
				div[i + (1 + n) * j] = pow(2, i) * (pow(5, j));
			}
		}
		Arrays.sort(div);
		for (int i = 0; i < div.length; ++i) {
			System.out.println(div[i]);
		}

	}

	long pow(long a, long n) {
		long ret = 1;
		for (; n > 0; n >>= 1, a = a * a) {
			if (n % 2 == 1) {
				ret = ret * a;
			}
		}
		return ret;
	}

	public static void main(String[] args) {
		new Main().run();
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}