#include <bits/stdc++.h>
#define int long long
#define ll __int128
using namespace std;
namespace FPS{
	int N;
	vector<int> rev,_inv = {0,1};
	template <const int mod = 998244353>
	struct fps: vector<int>{
		void NTT_init(int n){ //NTT 前将次数扩增成 2 的幂，预处理 rev[] 数组
			if(N >= n && N < (n << 1)) return;
			int c = -1;
			N = 1;
			while(N < n) N <<= 1,c ++;
			if(N > rev.size()) rev.resize(N);
			for(int i = 0; i < N; i ++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << c);
		}
		void inv_init(int n){ //预处理
			int t = _inv.size();
			if(n > t) _inv.resize(n);
			for(int i = t; i < n; i ++) _inv[i] = 1ll * _inv[mod % i] * dec(0,mod / i) % mod;
		}
		int add(int x,int y){
			x += y;
			return x < mod ? x : x - mod;
		}
		int dec(int x,int y){
			x -= y;
			return x >= 0 ? x : x + mod;
		}
		int qpow(int x,int k){
			int d = 1;
			while(k){
				if(k & 1) d = 1ll * d * x % mod;
				x = 1ll * x * x % mod,k >>= 1;
			}
			return d;
		}
		friend fps operator * (fps f,fps g){ // 返回 f * g
			static int t;
			t = f.size() + g.size() - 1;
			if(min(f.size(),g.size()) <= 40){
				fps ret(t);
				for(int i = 0; i < f.size(); i ++)
					for(int j = 0; j < g.size(); j ++)
						ret[i + j] = (ret[i + j] + 1ll * f[i] * g[j]) % mod;
				return ret;
			}
			f.NTT_init(t);
			f.NTT(1),g.NTT(1);
			for(int i = 0; i < N; i ++) f[i] = 1ll * f[i] * g[i] % mod;
			f.NTT(-1);
			return f.pre(t);
		}
		friend fps operator + (fps f,fps g){ // 多项式加法
			if(f.size() < g.size()) f.swap(g);
			for(int i = 0; i < g.size(); i ++) f[i] = add(f[i],g[i]);
			return f;
		}
		friend fps operator - (fps f,fps g){ // 多项式减法
			if(f.size() < g.size()) f.resize(g.size());
			for(int i = 0; i < g.size(); i ++) f[i] = dec(f[i],g[i]);
			return f;
		}
		#define f (*this)
		using vector<int>::vector;
		inline fps pre(int n){
			return fps(f.begin(),f.begin() + min((int)f.size(),n));
		}
		void NTT(int op){ // NTT，op = 1 表示正变换，否则逆变换
			f.resize(N);
			int g = qpow(3, mod - 2);
			for(int i = 0; i < N; i ++) if(i < rev[i]) ::swap(f[i],f[rev[i]]);
			for(int i = 1; i < N; i <<= 1){
				int w1 = qpow(op == 1 ? 3 : g,(mod - 1) / (i << 1));
				for(int j = 0; j < N; j += i << 1){
					int w = 1;
					for(int k = j; k < j + i; k ++){
						int t1 = f[k],t2 = 1ll * w * f[k + i] % mod;
						f[k] = add(t1,t2),f[k + i] = dec(t1,t2);
						w = 1ll * w * w1 % mod;
					}
				}
			}
			if(op == -1){
				int iv = qpow(N,mod - 2);
				for(int i = 0; i < N; i ++) f[i] = 1ll * f[i] * iv % mod;
			}
		}
		fps inv(int n = 0){ // f.inv(n) 返回 1/f(x) mod x^n，n=0 时默认为 f.size()
			if(!n) n = f.size();
			fps g = {qpow(f[0],mod - 2)},h;
			int d = 1;
			while(d < n){
				d <<= 1;
				NTT_init(d << 1),h = f.pre(d);
				g.NTT(1),h.NTT(1);
				for(int i = 0; i < N; i ++) g[i] = 1ll * g[i] * dec(2,1ll * h[i] * g[i] % mod) % mod;
				g.NTT(-1),g.resize(d);
			}
			return g.pre(n);
		}
		fps ln(int n = 0){ // 调用 f.ln(n) 返回 ln(f(x)) mod x^n，n=0 时默认为 f.size()，需保证 f[0] = 1
			if(!n) n = f.size();
			fps h = f.pre(n);
			for(int i = 0; i + 1 < h.size(); i ++) h[i] = 1ll * (i + 1) * h[i + 1] % mod;
			h.pop_back();
			h = (h * f.inv(n + 1)).pre(n);
			inv_init(n);
			for(int i = n - 1; i >= 1; i --) h[i] = 1ll * h[i - 1] * _inv[i] % mod;
			h[0] = 0;
			return h;
		}
		fps exp(int n = 0){ // 调用 f.exp(n) 返回 exp(f(x)) mod x^n，n=0 时默认为 f.size()，需保证 f[0] = 0
			if(!n) n = f.size();
			fps g = {1};
			int d = 1;
			while(d < n){
				d <<= 1;
				g = g * (fps{1} + f.pre(d) - g.ln(d));
			}
			return g.pre(n);
		}
		void in(int n){
			int x;
			for(int i = 1; i <= n; i++)  cin >> x, f.push_back(x);
		}
		void out(){
			for(int x: f)  cout << x << ' ';
			cout << '\n';
		}
		fps(vector <int> x){ f.resize(x.size()); for(int i = 0; i < x.size(); i++) f[i] = x[i] % mod;}
		#undef f
	};
}
using FPS::fps;
int read(){
	int x = 0,f = 1;
	char c = getchar();
	while(c < '0' || c > '9'){
		if(c == '-') f = -1;
		c = getchar();
	}
	while(c >= '0' && c <= '9') x = x * 10 + (c ^ 48),c = getchar();
	return x * f;
}
fps<> calc(vector<fps<>> &v,int l,int r){
	if(l == r) return v[l];
	int mid = (l + r) >> 1;
	return calc(v,l,mid) * calc(v,mid + 1,r);
}
const int m1 = 998244353, m2 = 1004535809, m3 = 104857601;
ll qpow(ll x, ll y, ll p){
	if(!y) return 1;
	return qpow(x * x % p, y >> 1, p) * (y & 1? x: 1) % p;
}
const int N = 50005, V = 1e10;
ll ans[N], g[N];
int n;
signed main(){
	cin >> n;
	vector <int> f(n + 1);
	f[0] = V;
	for(int i = 1; i <= n; i++){
		if(i > 50){ ans[i] = V; continue;}
		fps <m1> f1(f); fps <m2> f2(f); fps <m3> f3(f);
		f1 = f1 * f1, f2 = f2 * f2, f3 = f3 * f3;
		ll p = (ll)m1 * m2 * m3, c1 = (ll)m2 * m3 * qpow(m2 * m3 % m1, m1 - 2, m1), c2 = (ll)m1 * m3 * qpow(m1 * m3 % m2, m2 - 2, m2), c3 = (ll)m2 * m1 * qpow(m2 * m1 % m3, m3 - 2, m3);
		for(int j = 1; j <= n; j++) f[j] = (f1[j - 1] * c1 + f2[j - 1] * c2 + f3[j - 1] * c3) % p / V / j;
		ans[i] = f[n];
	}
	for(int i = 1; i <= n; i++) cout << fixed << setprecision(10) << 1. * (ans[i] - ans[i - 1]) / V << '\n';
	return 0;
}