#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> two, five;
  two.push_back(1), five.push_back(1);
  ll u = 1, v = 1;
  for (int i = 1; i <= n; ++i) {
    u *= 2, v *= 5;
    two.push_back(u), five.push_back(v);
  }
  set<ll> st;
  for (int i = 0; i < two.size(); ++i) {
    for (int j = 0; j < five.size(); ++j) {
      st.insert(two[i] * five[j]);
    }
  }
  for (auto ans : st) {
    cout << ans << endl;
  }
  return 0;
}