#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    ll n; cin >> n;
    if (n == 0) {
        cout << 1 << "\n";
        return 0;
    }
    auto modinv = [] (ll a) -> ll {
        ll ret = 1, base = a, exp = MOD - 2;
        while (exp) {
            if (exp & 1) ret = ret * base % MOD;
            base = base * base % MOD;
            exp >>= 1;
        }
        return ret;
    };
    vector<ll> b(n + 1, 0);
    b[n] = 2;
    ll val = 1;
    for (ll k = 1; k <= n / 2; k++) {
        val = (val * (n - k + 1) % MOD) * modinv(k) % MOD;
        if (n - 2 * k) b[n - 2 * k] = (val * 2) % MOD;
        else b[n - 2 * k] = val;
    }
    for (int i = 0; i <= n; i++) cout << b[i] << (i == n ? "\n" : " ");
    return 0;
}