#include <bits/stdc++.h>

using namespace std;

const long long mod = 998244353;
const int MaxN = 2e6 + 5;

int k;

void Inp()
{
    cin >> k;
}

long long Pow2[MaxN];
long long Fact[MaxN];
long long RevFact[MaxN];

long long C(int k, int n)
{
    if (k > n)
    {
        return 0;
    }
    return ((Fact[n] * RevFact[k]) % mod * RevFact[n - k]) % mod;
}

long long res[MaxN];
long long Dp1[MaxN];
long long Dp2[MaxN];

void Exc()
{
    Pow2[0] = Fact[0] = 1;
    for (int x = 1; x <= 4 * k; x++)
    {
        Pow2[x] = (Pow2[x - 1] * 2) % mod;
        Fact[x] = (Fact[x - 1] * x) % mod;
    }
    RevFact[1] = 1;
    for (int x = 2; x <= 4 * k; x++)
    {
        RevFact[x] = (mod - (mod / x) * RevFact[mod % x] % mod) % mod;
    }
    RevFact[0] = 1;
    for (int x = 1; x <= 4 * k; x++)
    {
        RevFact[x] = (RevFact[x - 1] * RevFact[x]) % mod;
    }
    cout << ((Pow2[k + 1] - 1) % mod + mod) % mod << " ";
    long long cur = 0;
    for (int x = 1; x < k; x++)
    {
        Dp1[2 * k - 2] = (Dp1[2 * k - 2] + C(2 * k - 2, 2 * x) * Pow2[k - x - 1] % mod) % mod;
        Dp1[2 * k - 3] = (Dp1[2 * k - 3] + C(2 * k - 3, 2 * x) * Pow2[k - x - 1] % mod) % mod;
        Dp2[2 * k - 2] = (Dp2[2 * k - 2] + C(2 * k - 2, 2 * x + 1) * Pow2[k - x - 1] % mod) % mod;
        Dp2[2 * k - 3] = (Dp2[2 * k - 3] + C(2 * k - 3, 2 * x + 1) * Pow2[k - x - 1] % mod) % mod;
    }
    res[2 * k - 2] = (res[2 * k - 2] + Dp1[2 * k - 2]) % mod;
    res[2 * k - 3] = (res[2 * k - 3] + Dp1[2 * k - 3]) % mod;
    for (int x = 2 * k - 4; x > 1; x--)
    {
        Dp1[x] = (Dp1[x + 2] * 2 % mod - C(x + 2, 2) * Pow2[k - 1] % mod + C(x + 2, 2 * k)) % mod;
        Dp1[x] = (Dp1[x] - Dp2[x + 2] - Dp1[x + 1]) % mod;
        Dp2[x] = (Dp2[x + 2] * 2 % mod - C(x + 2, 3) * Pow2[k - 1] % mod + C(x + 2, 2 * k + 1)) % mod;
        Dp2[x] = (Dp2[x] - 2 * Dp1[x + 2] + C(x + 2, 2) * Pow2[k - 1] - C(x + 2, 2 * k) - Dp2[x + 1]) % mod;
        res[x] = (res[x] + Dp1[x]) % mod;
    }
    cur = 0;
    for (int x = 1; x < k; x++)
    {
        cur = (cur + C(2, x) * Pow2[k - x - 1] % mod) % mod;
    }
    res[2] = (res[2] - 2 * cur % mod) % mod;
    for (int x = 3; x <= 2 * k - 2; x++)
    {
        cur = (cur - C(x, k) + C(x, 1) * Pow2[k - 1] % mod) % mod;
        res[x] = (res[x] - 2 * cur % mod) % mod;
    }
    cur = 0;
    for (int x = 1; x < k; x++)
    {
        cur = (cur + C(1, x) * Pow2[k - x - 1] % mod) % mod;
    }
    res[2] = (res[2] + 2 * cur % mod) % mod;
    for (int x = 3; x <= 2 * k - 2; x++)
    {
        cur = (cur - C(x - 1, k) + C(x - 1, 1) * Pow2[k - 1] % mod) % mod;
        res[x] = (res[x] + 2 * cur % mod) % mod;
    }
    for (int x = 2; x <= 2 * k - 2; x++)
    {
        cout << (res[x] % mod + mod) % mod << " ";
    }
}

int main()
{
    //freopen("D.INP", "r", stdin);
    //freopen("D.OUT", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int test = 1;
    //cin >> test;
    for (int x = 1; x <= test; x++)
    {
        Inp();
        Exc();
    }
    return 0;
}