#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

typedef complex<db> com;

const db PI = acos(-1.0);
const int LEN = 1 << 16;

com pw[LEN];

void initFFT()
{
	db angle = 2 * PI / LEN;
	FOR(i, 0, LEN)
		pw[i] = {cos(i * angle), sin(i * angle)};
}

void fft(vector<com>& a, bool inv)
{
	int lg = __builtin_ctz(SZ(a));
	FOR(i, 0, SZ(a))
	{
		int k = 0;
		FOR(j, 0, lg)
			k |= ((i >> j) & 1) << (lg - j - 1);
		if(i < k)
			swap(a[i], a[k]);
	}
	int k = inv ? LEN - LEN / 4 : LEN / 4;
	//int g = inv ? binpow(GEN, mod - 2) : GEN, k = binpow(g, LEN / 4);
	for(int len = 1; len < SZ(a); len *= 4)
	{
		if (2 * len == SZ(a))
		{
			int diff = inv ? LEN - LEN / (2 * len) : LEN / (2 * len), pos = 0;
			// int ml = binpow(g, LEN / (2 * len)), pw = 1;
			FOR(j, 0, len)
			{
				com u = a[j];
				com v = a[j + len] * pw[pos];
				a[j] = u + v;
				a[j + len] = u - v;
				pos = (pos + diff) % LEN;
				// pw = mult(pw, ml);
			}
		}
		else
		{
			int diff = inv ? LEN - LEN / (4 * len) : LEN / (4 * len), pos = 0;
			// int ml = binpow(g, LEN / (4 * len)), pw = 1;
			FOR(j, 0, len)
			{
				int pos2 = (2 * pos) % LEN, pos3 = (3 * pos) % LEN;
				// int pw2 = mult(pw, pw), pw3 = mult(pw2, pw);
				for(int i = j; i < SZ(a); i += 4 * len)
				{
					com a0 = a[i];
					com a1 = a[i + len] * pw[pos2];
					com a2 = a[i + 2 * len] * pw[pos];
					com a3 = a[i + 3 * len] * pw[pos3];
					com a0p1 = a0 + a1, a2p3 = a2 + a3,
						a0m1 = a0 - a1, a2m3 = pw[k] * (a2 - a3); // pw[k] * 
					a[i] = a0p1 + a2p3;
					a[i + len] = a0m1 + a2m3;
					a[i + 2 * len] = a0p1 - a2p3;
					a[i + 3 * len] = a0m1 - a2m3;
				}
				pos = (pos + diff) % LEN;
				//pw = mult(pw, ml);
			}
		}
	}
	if(inv)
	{
		// int m = binpow(SZ(a), mod - 2);
		FOR(i, 0, SZ(a))
			a[i] /= SZ(a);
			// a[i] = mult(a[i], m); 
	}
}

vector<db> mult(const vector<db>& a, const vector<db>& b)
{
	vector<com> ac(ALL(a)), bc(ALL(b));
	int lg = 0;
	while ((1 << lg) < SZ(a) + SZ(b) - 1)
		lg++;
	ac.resize(1 << lg);
	bc.resize(1 << lg);
	fft(ac, false);
	fft(bc, false);
	FOR(i, 0, SZ(ac))
		ac[i] *= bc[i];
	fft(ac, true);
	vector<db> c(SZ(a) + SZ(b) - 1);
	FOR(i, 0, SZ(c))
		c[i] = ac[i].real();
	return c;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(6);
	initFFT();
	int n;
	cin >> n;
	vector<db> ans(n, 1);
	if (n > 1)
		ans[0] = 0;
	vector<db> f = {1, 1};
	FOR(j, 1, min(n, 55))
	{
		vector<db> nf = mult(f, f);
		f.resize(min(n, SZ(nf)) + 1);
		f[0] = 1;
		FOR(i, 1, SZ(f))
			f[i] = nf[i - 1] / i;
		ans[j] = n < SZ(f) ? f[n] : 0;
	}
	RFOR(i, SZ(ans), 1)
		ans[i] -= ans[i - 1];
	FOR(i, 0, n)
		cout << ans[i] << "\n";
	cerr << (db)clock() / CLOCKS_PER_SEC << endl;
	return 0;
}