#include <bits/stdc++.h>
using namespace std;

const long long MOD = 998244353;
const int MAXN = 500005;

long long fact[MAXN];
long long inv_fact[MAXN];

long long binpow(long long a, long long b) {
    if (b == 0) {
        return 1;
    }
    long long c = binpow(a, b / 2);
    if (b % 2 == 0) {
        return c * c % MOD;
    } else {
        return c * c % MOD * a % MOD;
    }
}

long long modinv(long long a) {
    return binpow(a, MOD - 2);
}

long long nck(int n, int k) {
    if (k > n) {
        return 0;
    }
    return fact[n] * inv_fact[n - k] % MOD * inv_fact[k] % MOD;
}

vector<long long> divide(vector<long long> &p, vector<long long> &q) {
    vector<long long> res(p.size());
    for (int i = p.size() - 1; i >= q.size() - 1; i--) {
        int pow_diff = i - q.size() + 1;
        long long mult_diff = p[i] * modinv(q[q.size() - 1]) % MOD;
        res[pow_diff] = mult_diff;
        for (int j = 0; j < q.size(); j++) {
            p[j + pow_diff] -= q[j] * mult_diff % MOD;
            p[j + pow_diff] = (p[j + pow_diff] + MOD) % MOD;
        }
    }
    return res;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    fact[0] = 1;
    for (int i = 1; i < MAXN; i++) {
        fact[i] = fact[i - 1] * i % MOD;
    }
    inv_fact[MAXN - 1] = modinv(fact[MAXN - 1]);
    for (int i = MAXN - 2; i >= 0; i--) {
        inv_fact[i] = inv_fact[i + 1] * (i + 1) % MOD;
    }

    int K;
    cin >> K;

    vector<long long> p1(K + 2);
    for (int i = 0; i <= K; i++) {
        p1[i] = 2 * nck(K, i) % MOD;
    }
    p1[0] = (p1[0] - binpow(2, K + 1) + MOD) % MOD;

    vector<long long> p2(2 * K + 1);
    for (int i = 0; i <= 2 * K; i++) {
        p2[i] = MOD - nck(2 * K, i);
    }
    p2[0] = (p2[0] + binpow(2, K)) % MOD;
    
    vector<long long> den {1, MOD - 2, MOD - 1};
    vector<long long> quo = divide(p2, den);

    vector<long long> res(2 * K - 1);
    res[0] = binpow(2, K) - 1;
    res[1] = 1;
    for (int i = 1; i <= 2 * K - 2; i++) {
        res[i] += quo[i];
        if (i <= K + 1) {
            res[i] += p1[i];
        }
        res[i] %= MOD;
        cout << res[i] << " ";
    }
    cout << "\n";
}