#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f(i,j,k) for(int i=j;i<=k;++i)
#define g(i,j,k) for(int i=j;i>=k;--i)
int n,m,s,l;
const int N=2e5;
#define double long double
const double eps=1e-9,Pi=acos(-1.0);
struct xy{double x,y;};
inline xy operator+(xy a,xy b){return{a.x+b.x,a.y+b.y};}
inline xy operator-(xy a,xy b){return{a.x-b.x,a.y-b.y};}
inline xy operator*(xy a,xy b){return{a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x};}
int r[N];
#define h(a,b,c,d) for(int a=b;a<c;a+=d)
inline void FFT(xy*a,int n,int p){
	h(i,1,n,1)if(i<r[i])swap(a[i],a[r[i]]);
	xy u,v,w,g;
	h(k,1,n,k){
		g={cos(Pi/k),(p?-1:1)*sin(Pi/k)};
		h(i,0,n,k*2){
			w={1,0};
			h(j,0,k,1){
				u=a[i+j];v=a[i+j+k]*w;w=w*g;
				a[i+j]=u+v;a[i+j+k]=u-v;
			}
		}
	}
	if(p)h(i,0,n,1)a[i].x/=n;
}
inline void sqr(xy*a,int s){
	int n=2,m=0;
	for(;n<=s+s;n*=2)++m;
	h(i,1,n,1)r[i]=(r[i>>1]>>1)|((i&1)<<m);
	f(i,s+1,n)a[i]={};
	FFT(a,n,0);
	f(i,0,n)a[i]=a[i]*a[i];
	FFT(a,n,1);
}
double f[N],g[N];xy a[N];
signed main(){
	cin>>n;f[0]=1;
	f(p,1,n){
		if(p>50){g[p]=1;continue;}
		f(i,0,n)a[i].x=f[i];sqr(a,n);
		f(i,1,n)f[i]=a[i-1].x/i;g[p]=f[n];
		f(i,1,n)if(fabs(f[i])<eps)f[i]=0;
	}
	f(p,1,n)printf("%.5Lf\n",g[p]-g[p-1]);
	return 0;
}