#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize(3)
#define DB double
#define LL long long
#define ULL unsigned long long
#define in128 __int128
#define cint const int
#define cLL const LL
#define For(z,e1,e2) for(int z=(e1);z<=(e2);z++)
#define Rof(z,e1,e2) for(int z=(e2);z>=(e1);z--)
#define For_(z,e1,e2) for(int z=(e1);z<(e2);z++)
#define Rof_(z,e1,e2) for(int z=(e2);z>(e1);z--)
#define inint(e) scanf("%d",&e)
#define inll(e) scanf("%lld",&e)
#define inpr(e1,e2) scanf("%d%d",&e1,&e2)
#define in3(e1,e2,e3) scanf("%d%d%d",&e1,&e2,&e3)
#define outint(e) printf("%d\n",e)
#define outint_(e) printf("%d%c",e," \n"[i==n])
#define outint2_(e,e1,e2) printf("%d%c",e," \n"[(e1)==(e2)])
#define outll(e) printf("%lld\n",e)
#define outll_(e) printf("%lld%c",e," \n"[i==n])
#define outll2_(e,e1,e2) printf("%lld%c",e," \n"[(e1)==(e2)])
#define exc(e) if(e) continue
#define stop(e) if(e) break
#define ret(e) if(e) return
#define ll(e) (1ll*(e))
#define pb push_back
#define ft first
#define sc second
#define pii pair<int,int> 
#define pli pair<LL,int> 
#define vct vector 
#define clean(e) while(!e.empty()) e.pop()
#define all(ev) ev.begin(),ev.end()
#define sz(ev) ((int)ev.size())
#define debug(x) printf("%s=%d\n",#x,x)
#define x0 __xx00__
#define y1 __yy11__
#define ffo fflush(stdout)
cLL mod=998244353,G=404;
// cLL mod[2]={1686688681ll,1888686661ll},base[2]={166686661ll,188868881ll};
template <typename Type> void get_min(Type &w1,const Type w2) { if(w2<w1) w1=w2; } template <typename Type> void get_max(Type &w1,const Type w2) { if(w2>w1) w1=w2; }
template <typename Type> Type up_div(Type w1,Type w2) { return (w1/w2+(w1%w2?1:0)); }
template <typename Type> Type gcd(Type X_,Type Y_) { Type R_=X_%Y_; while(R_) { X_=Y_; Y_=R_; R_=X_%Y_; } return Y_; } template <typename Type> Type lcm(Type X_,Type Y_) { return (X_/gcd(X_,Y_)*Y_); }
template <typename Type> Type md(Type w1,const Type w2=mod) { w1%=w2; if(w1<0) w1+=w2; return w1; } template <typename Type> Type md_(Type w1,const Type w2=mod) { w1%=w2; if(w1<=0) w1+=w2; return w1; }
void ex_gcd(LL &X_,LL &Y_,LL A_,LL B_) { if(!B_) { X_=1ll; Y_=0ll; return ; } ex_gcd(Y_,X_,B_,A_%B_); X_=md(X_,B_); Y_=(1ll-X_*A_)/B_; } LL inv(LL A_,LL B_=mod) { LL X_=0ll,Y_=0ll; ex_gcd(X_,Y_,A_,B_); return X_; }
template <typename Type> void add(Type &w1,const Type w2,const Type M_=mod) { w1=md(w1+w2,M_); } void mul(LL &w1,cLL w2,cLL M_=mod) { w1=md(w1*md(w2,M_),M_); } template <typename Type> Type pw(Type X_,Type Y_,Type M_=mod) { Type S_=1; while(Y_) { if(Y_&1) mul(S_,X_,M_); Y_>>=1; mul(X_,X_,M_); } return S_; }
template <typename Type> Type bk(vector <Type> &V_) { auto T_=V_.back(); V_.pop_back(); return T_; } template <typename Type> Type tp(stack <Type> &V_) { auto T_=V_.top(); V_.pop(); return T_; } template <typename Type> Type frt(queue <Type> &V_) { auto T_=V_.front(); V_.pop(); return T_; }
template <typename Type> Type bg(set <Type> &V_) { auto T_=*V_.begin(); V_.erase(V_.begin()); return T_; } template <typename Type> Type bk(set <Type> &V_) { auto T_=*prev(V_.end()); V_.erase(*prev(V_.end())); return T_; }
mt19937 gen(time(NULL)); int rd() { return abs((int)gen()); }
cint H=22,L=1<<H|11,UP=14;
vct <LL> z[H+1];
LL z2[H+1];
void main_init()
{
    For(i,0,H)
    {
        z2[i]=inv(1ll<<i);
        LL s=1ll,t=pw(G,(mod-1ll)>>i);
        For_(j,0,1<<i) z[i].pb(s),mul(s,t);
    }
}
int rev[L];
int minsz(int w)
{
    return (__lg(w)+(w!=(w&-w)));
}
struct Poly
{
    vct <LL> v;
    void NTT(bool opt)
    {
        int d=minsz(sz(v)),l=1<<d;
        v.resize(l);
        For_(i,1,l)
        {
            rev[i]=(rev[i>>1]>>1)|((i&1)<<d-1);
            if(i<rev[i]) swap(v[i],v[rev[i]]);
        }
        For_(k,0,d)
        {
            for(int i=0;i<l;i+=(1<<k+1))
            For_(j,i,i|(1<<k))
            {
                int j2=(j|(1<<k));
                // printf("%d,%d\n",sz(z[k+1]),(i^j));
                // assert(sz(z[k+1])>(i^j));
                LL t=v[j2]*z[k+1][(i^j)]%mod;
                v[j2]=v[j]-t;
                v[j]+=t;
            }
            if(k==UP) for(auto &i:v) i=md(i);
        }
        if(d!=UP+1) for(auto &i:v) i=md(i);
        ret(!opt);
        LL t=z2[d];
        for(auto &i:v) mul(i,t);
        reverse(v.begin()+1,v.end());
    }
    void Mul(Poly &A)
    {
        int n=sz(v)+sz(A.v)-1,l=(1<<minsz(n));
        v.resize(l); NTT(false);
        A.v.resize(l); A.NTT(false);
        For_(i,0,l) mul(v[i],A.v[i]);
        // return ;
        NTT(true);
        v.resize(n);
    }
    void Mul2()
    {
        int n=sz(v)*2-1,l=(1<<minsz(n));
        v.resize(l); NTT(false);
        For_(i,0,l) mul(v[i],v[i]);
        NTT(true);
        v.resize(n);
    }
};
int hhh=0;
void Inv(Poly &C,int n)
{
    int ttt=clock();
    int m=1,n2=sz(C.v);
    Poly x={{inv(C.v[0])}};
    while(m<=n)
    {
        m<<=1;
        Poly x2=x,C2={{}};
        For_(i,0,min(m,n2)) C2.v.pb(C.v[i]);
        x.Mul(C2);
        x.v.resize(m);
        for(auto &i:x.v) i=(i?(mod-i):0ll);
        add(x.v[0],2ll);
        x.Mul(x2);
        x.v.resize(m);
    }
    x.v.resize(n);
    C=x;
    hhh+=clock()-ttt;
}
void pw(Poly &x,int w,int m)
{
    Poly s={{1ll}};
    while(w)
    {
        if(w&1)
        {
            // for(auto i:x.v) printf("%lld ",i); printf("\n");
            Poly x2=x;
            s.Mul(x2);
            if(sz(s.v)>m) s.v.resize(m);
        }
        w>>=1;
        x.Mul2();
        if(sz(x.v)>m) x.v.resize(m);
    }
    x=s;
}
cint N=5.01e5;
LL ans[N<<1],d1[N],d2[N];
void main_solve()
{
    int n,m;
    // n=500000; //E
    inint(n); //E
    m=n<<1;
    Poly w,w2;
    LL iv2=inv(2ll);
    w={{iv2,1ll,iv2}};
    pw(w,n,m); add(w.v[0],-1ll);
    for(auto &i:w.v) mul(i,2ll);
    w2={{mod-1ll,2ll,1ll}};
    Inv(w2,m);
    w.Mul(w2);
    For_(i,0,m) add(ans[i],w.v[i]);
    d1[0]=1ll; For(i,1,n) d1[i]=d1[i-1]*i%mod;
    d2[n]=inv(d1[n]); Rof(i,1,n) d2[i-1]=d2[i]*i%mod;
    LL t=pw(iv2,1ll*n);
    w.v.clear();
    For(i,0,n) w.v.pb(t*(d1[n]*(d2[i]*d2[n-i]%mod)%mod)%mod);
    For_(i,n+1,m) w.v.pb(0ll);
    add(w.v[0],-1ll);
    for(auto &i:w.v) mul(i,4ll);
    For_(i,0,m) add(ans[i],w.v[i]);
    t=pw(2ll,1ll*(n-1));
    For(i,0,m) mul(ans[i],t);
    add(ans[1],1ll),add(ans[0],t*2ll-1ll);
    For_(i,1,m-1) outll2_(ans[i],i,m-2); //E
    // outint(hhh); //E
    // outint(clock()); //E
}
int main()
{
    // ios::sync_with_stdio(0); cin.tie(0);
    // freopen("in.txt","r",stdin);
    // freopen("out.txt","w",stdout);
    // srand(time(NULL));
    main_init();
    // int _; inint(_); For(__,1,_) // T>1 ?
        // printf("\n------------\n\n"),
        main_solve();
    return 0;
}
/*

*/