// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}

#include<atcoder/convolution>
#include<atcoder/modint>
using namespace atcoder;
using mint = modint998244353;


void solve(){
    ll n;
    cin >> n;
    VV<mint> v(19);
    v[0] = {0, 1};
    v[1] = {mint(1)/2, 0, mint(1)/2};
    REP(i, 1, 17){
        auto c = convolution(v[i], v[i]);
        auto w = v[i];
        auto d = convolution(v[i], w);
        ll m = w.size();
        ll nn = d.size();
        v[i+1].resize(nn, 0);
        rep(j, nn) v[i+1][j] = c[j] / 2;
        rep(j, nn) v[i+1][abs(j-nn/2)] += d[j] / 2;
        // cout << nn << endl;
        // if(i <= 5){
        //     for(auto x:v[i]) cout << x.val() << ' ';
        //     cout << endl;
        // }
    }
    V<mint> ans;
    for(ll i=17; i>=0; i--) if(n>>i&1){
        if(ans.empty()) ans = v[i];
        else if(i){
            auto c = convolution(ans, v[i]);
            reverse(be(ans));
            auto d = convolution(v[i], ans);
            ll m = d.size();
            ll nn = ans.size();
            rep(j, m) c[j] /= 2;
            rep(j, m) c[abs(j-nn+1)] += d[j] / 2;
            swap(ans, c);
        }else{
            ll m= ans.size()+1;
            V<mint> vv(m, 0);
            rep(i, m-1) vv[i+1] = ans[i] / 2;
            rep(i, m-1) vv[abs(i-1)] += ans[i]/ 2;
            swap(vv, ans);
        }
        // for(auto x:ans) cout << x.val() << ' ';
        // cout << endl;
        
    }
    mint m = 2;
    m = m.pow(n);
    rep(i, n+1) cout << (ans[i]*m).val() << " \n"[i==n];
    
}





int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}