#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n;
  cin >> n;
  vector<ll> pow_2(n + 1), pow_5(n + 1);
  pow_2[0] = pow_5[0] = 1;
  for (int i = 0; i < n; ++i) {
    pow_2[i + 1] = pow_2[i] * 2;
    pow_5[i + 1] = pow_5[i] * 5;
  }
  set<ll> st;
  for (int i = 0; i <= n; ++i) {
    for (int j = 0; j <= n; ++j) {
      st.insert(pow_2[i] * pow_5[j]);
    }
  }
  for (auto ans : st) {
    cout << ans << endl;
  }
  return 0;
}