#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using i64 = long long;

int main(void) {
  int n; scanf("%d", &n);
  vector<i64> v;
  for(int i=0; i<=n; ++i) {
    for(int j=0; j<=n; ++j) {
      // 2**i * 5**j
      v.push_back(i64(powl(2, i) * powl(5, j)));
    }
  }
  sort(begin(v), end(v));
  for(i64 x : v) {
    printf("%lld\n", x);
  }
  return 0;
}