#include<ctime>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#define p 998244353
#define rt register int
#define ll long long
using namespace std;
inline ll read(){ll x = 0; char zf = 1; char ch = getchar();while (ch != '-' && !isdigit(ch)) ch = getchar();if (ch == '-') zf = -1, ch = getchar();while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar(); return x * zf;
}
void write(ll y){if(y<0)putchar('-'),y=-y;if(y>9)write(y/10);putchar(y%10+48);}
void writeln(const ll y){write(y);putchar('\n');}
int i,j,k,m,n,x,y,z,cnt;
int A[270010],B[270010],R[270010],b[335][100010];
int ksm(int x,int y){int ans=1;for(rt i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*x*ans%p;return ans;
}
void NTT(int n,int *A,int fla){for(rt i=0;i<n;i++)if(i>R[i])swap(A[i],A[R[i]]);for(rt i=1;i<n;i<<=1){int w=ksm(3,(p-1)/2/i);for(rt j=0;j<n;j+=i<<1){int K=1;for(rt k=0;k<i;k++,K=1ll*K*w%p){int x=A[j+k],y=1ll*K*A[i+j+k]%p;A[j+k]=(x+y)%p,A[i+j+k]=(x-y)%p;}}}if(fla==-1){reverse(A+1,A+n);int invn=ksm(n,p-2);for(rt i=0;i<n;i++)A[i]=1ll*A[i]*invn%p;}
}
int main(){n=read();int blo=(int)sqrt(n);A[0]=1; for(rt i=1;i<=blo;i++)for(rt j=i;j<=n;j++)(A[j]+=A[j-i])%=p;b[0][0]=1;for(rt i=1;i*blo<=n;i++)for(rt j=1;j+i*blo<=n;j++){b[i][j]=(b[i-1][j-1]+((j>=i)?b[i][j-i]:0))%p;(B[j+i*blo]+=b[i][j])%=p;}A[0]=B[0]=1;int lim=1;while(lim<=n+n)lim<<=1;for(rt i=1;i<lim;i++)R[i]=(R[i>>1]>>1)|(i&1)*(lim>>1); NTT(lim,A,1);NTT(lim,B,1);for(rt i=0;i<lim;i++)A[i]=1ll*A[i]*B[i]%p;NTT(lim,A,-1);for(rt i=1;i<=n;i++)writeln((A[i]+p)%p);return 0;
}