#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#include <experimental/iterator>
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(const char *s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(const char *s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

namespace {

using llf = double;
using C = complex<llf>;
const llf PI = acos(llf(-1));

template <int maxn>
struct FFT {
  C roots[maxn];
  FFT() {
    for (int i = maxn >> 1; i; i >>= 1) {
      for (int j = 0; j < i; ++j)
        roots[i + j] = polar<llf>(1, PI * j / i);
    }
  }
  void operator()(C F[], int n, bool inv = false) {
    for (int i = 0, j = 0; i < n; ++i) {
      if (i < j) swap(F[i], F[j]);
      for (int k = n >> 1; (j ^= k) < k; k >>= 1);
    }
    for (int s = 1; s < n; s *= 2) {
      for (int i = 0; i < n; i += s * 2) {
        for (int j = 0; j < s; j++) {
          C a = F[i + j], b = F[i + j + s] * roots[s + j];
          F[i + j] = a + b;
          F[i + j + s] = a - b;
        }
      }
    }
    if (inv) {
      for (int i = 0; i < n; ++i)
        F[i] /= n;
      reverse(F + 1, F + n);
    }
  }
};
FFT<1 << 18> fft;

vector<llf> mul(vector<llf> a, vector<llf> b) {
  int sz = 1;
  while (sz < int(a.size() + b.size()))
    sz *= 2;
  vector<C> A(sz), B(sz);
  for (size_t i = 0; i < a.size(); ++i)
    A[i] = C{a[i], 0};
  for (size_t i = 0; i < b.size(); ++i)
    B[i] = C{b[i], 0};
  fft(A.data(), sz);
  fft(B.data(), sz);
  for (int i = 0; i < sz; ++i)
    A[i] *= B[i];
  fft(A.data(), sz, true);
  vector<llf> c(a.size() + b.size() - 1);
  for (size_t i = 0; i < c.size(); ++i)
    c[i] = real(A[i]);
  //for (size_t i = 0; i < a.size(); i++)
  //  for (size_t j = 0; j < b.size(); j++)
  //    c[i + j] += a[i] * b[j];
  return c;
}

vector<llf> integ(vector<llf> a) {
  a.insert(a.begin(), 0);
  for (size_t i = 1; i < a.size(); i++)
    a[i] /= i;
  return a;
}

} // namespace

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  cout.precision(20);
  cout << fixed;
  int n; cin >> n;
  vector<llf> g = {1};
  //auto last = g;
  //last[0] = 1;
  //last[1] = 0;
  for (int it = 0; it < n; it++) {
    //orange(all(g));
    if (it > 80)
    {
      cout << "0\n";
      continue;
    }
    auto gg = g;
    g = integ(mul(g, g));
    g[0] += 1;
    if (g.size() > 30001)
      g.resize(30001);
    auto v = g;
    if (it == 0)
    {
      gg[0] = 0;
    }
    for (int i = 0; i < gg.size(); ++i)
      v[i] -= gg[i];
    orange(all(g));
    orange(all(v));
    if (g.size() > n) cout << v[n] << '\n';
    else cout << "0" << '\n';
  }
  return 0;
}