#ifdef FAST_ALLOCATOR_MEMORY
int allocator_pos = 0;
  char allocator_memory[(int)FAST_ALLOCATOR_MEMORY];
  inline void * operator new ( size_t n ) {
    char *res = allocator_memory + allocator_pos;
    allocator_pos += n;
    assert(allocator_pos <= (int)FAST_ALLOCATOR_MEMORY);
    return (void *)res;
  }
  inline void operator delete ( void * ) noexcept { }
  //inline void * operator new [] ( size_t ) { assert(0); }
  //inline void operator delete [] ( void * ) { assert(0); }
#endif

#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#pragma GCC target("avx2")
#pragma GCC target("popcnt")

#include <bits/stdc++.h>

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()

using namespace std;

const ll mod = 998244353;
const int maxn = 1e6 + 100;

inline int add(ll a, const ll& b)
{
    a += b;
    if (a >= mod) a -= mod;
    return a;
}

inline int sub(ll a, const ll& b)
{
    a -= b;
    if (a < 0) a += mod;
    return a;
}

inline int mul(const ll& a, const ll& b) { return (a * b) % mod; }

int dp[maxn];

signed main()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    dp[1] = 1;
    for (int i = 3; i <= (int)1e6; i += 2)
    {
        dp[i] = mul(3, dp[i - 2]);
        int res = 0;
        for (int j = 1; j <= i - 4; j += 2) res = add(res, mul(dp[j], dp[i - j - 3]));
        dp[i] = add(dp[i], mul(2, res));
    }
    for (int i = 0; i <= (int)1e6; ++i) cout << dp[i] << " ";
    return 0;
}