import java.util.*;

public class Main {
 	public static void main (String[] args) {
    	Scanner sc = new Scanner(System.in);
    	int n = sc.nextInt();
    	TreeSet<Long> ans = new TreeSet<>();
    	for (int i = 0; i <= n; i++) {
    	    long value = pow(2, i);
    	    for (int j = 0; j <= n; j++) {
    	        ans.add(value * pow(5, j));
    	    }
    	}
    	StringBuilder sb = new StringBuilder();
    	for (long x : ans) {
    	    sb.append(x).append("\n");
    	}
    	System.out.print(sb);
	}
	
	static long pow(long x, long y) {
	    if (y == 0) {
	        return 1;
	    } else {
	        return x * pow(x, y - 1);
	    }
	}
}