import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		scan.close();
		Set<Long> set = new TreeSet<Long>();
		Set<Long> set2 = new TreeSet<Long>();
		Long []M = {1L, 2L, 5L, 10L};
		set.add(1L);
		set.add(2L);
		set.add(5L);
		set.add(10L);
		if(N == 0) {
			System.out.println(1);
			System.exit(0);
		}
		for(int i = 0; i < N - 1; i++) {
			for(Long t1 : set) {
				for(Long t2 : M) {
					long t3 = t1 * t2;
					set2.add(t3);
				}
			}
			for(Long k : set2) {
				set.add(k);
			}
			set2.clear();
		}
		for(long t : set) {
			System.out.println(t);
		}
	}
}