#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

const int C = 60;
using val_t = complex<double>;

template<int MAXN>
struct FFT {
    const double PI = acos(-1);
    val_t w[MAXN];
    FFT() {
        for (int i = 0; i < MAXN; ++i) {
            double arg = 2 * PI * i / MAXN;
            w[i] = val_t(cos(arg), sin(arg));
        }
    }
    void bitrev(val_t *a, int n) {
        int i = 0;
        for (int j = 1; j < n - 1; ++j) {
            for (int k = n >> 1; (i ^= k) < k; k >>= 1);
            if (j < i) swap(a[i], a[j]);
        }
    }
    void operator()(val_t *a, int n, bool inv = false) {
        bitrev(a, n);
        for (int L = 2; L <= n; L <<= 1) {
            int dx = MAXN / L, dl = L >> 1;
            for (int i = 0; i < n; i += L) {
                for (int j = i, x = 0; j < i + dl; ++j, x += dx) {
                    val_t tmp = a[j + dl] * w[x];
                    a[j + dl] = a[j] - tmp;
                    a[j] += tmp;
                }
            }
        }
        if (inv) {
            reverse(a + 1, a + n);
            for (int i = 0; i < n; ++i) a[i] /= n;
        }
    }
};

const int N = 1 << 16;

#define fi(s, n) for (int i = (int)(s); i < (int)(n); ++i)
template<int MAXN>
struct Poly : vector<val_t> {
    using vector<val_t>::vector;
    static FFT<MAXN> fft;
    int n() const { return (int)size(); }
    Poly(const Poly &p, int m): vector<val_t>(m) {
        copy_n(p.data(), min(p.n(), m), data());
    }
    Poly &isz(int m) { return resize(m), *this; }
    Poly Mul(const Poly &rhs) const {
        int m = 1;
        while (m < n() + rhs.n() - 1) m <<= 1;
        Poly X(*this, m), Y(rhs, m);
        fft(X.data(), m), fft(Y.data(), m);
        fi(0, m) X[i] = X[i] * Y[i];
        fft(X.data(), m, true);
        return X.isz(n() + rhs.n() - 1);
    }
};
#undef fi
using Poly_t = Poly<N>;
template<> decltype(Poly_t::fft) Poly_t::fft = {};

FFT<N> fft;

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;

    vector<val_t> dp(N);
    dp[0] = 1;
    cout << fixed << setprecision(8);
    double last = 0;
    for (int i = 1; i <= n && i < C; ++i) {
        fft(dp.data(), N);
        for (int j = 0; j < N; ++j)
            dp[j] *= dp[j];
        fft(dp.data(), N, true);
        for (int j = n + 1; j < N; ++j)
            dp[j] = 0;
        for (int j = n; j >= 1; --j) {
            dp[j] = val_t(dp[j - 1].real() / (double)j, 0);
        }
        dp[0] = 1;
        cout << (dp[n].real() - last) << "\n";
        last = dp[n].real();
    }
    for (int i = C; i <= n; ++i)
        cout << (double)0 << "\n";
}