#include <bits/stdc++.h>
#define re register
#define int long long
#define Add(a,b) (((a) + (b)) % mod)
#define Mul(a,b) ((a) * (b) % mod)

using namespace std;

typedef vector<int> vi;
const int N = 3e5 + 10,mod = 998244353;
int n;
int inv[N];
unordered_map<int,vi> dp;

inline int read(){
    int r = 0,w = 1;
    char c = getchar();
    while (c < '0' || c > '9'){
        if (c == '-') w = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9'){
        r = (r << 3) + (r << 1) + (c ^ 48);
        c = getchar();
    }
    return r * w;
}

inline int qmi(int a,int b){
    int res = 1;
    while (b){
        if (b & 1) res = Mul(res,a);
        a = Mul(a,a); b >>= 1;
    }
    return res;
}

inline void dfs(int n){
    if (dp.count(n)) return;
    vi res(n);
    if (n <= 6){
        for (re int i = 0;i < n;i++) res[i] = inv[n];
        // cerr << n << " " << inv[n] << " ???\n";
    }
    else{
        dfs(5 * n / 6);
        dfs(5 * n / 6 + 1);
        const vi a = dp[5 * n / 6],b = dp[5 * n / 6 + 1];
        // cerr << n << " begin:\n";
        for (re int p = 0;p < 6;p++){
            int id = 0;
            for (re int i = 0;i < n;i++){
                if (i % 6 == p) continue;
                if (n % 6 <= p) res[i] = Add(res[i],b[id]);
                // ,cerr << i << " " << id << " " << b[id] << " second\n";
                else res[i] = Add(res[i],a[id]);
                // ,cerr << i << " " << id << " " << a[id] << " first\n";
                // cerr << i << " " << id << " !!!\n";
                id++;
            }
        }
        // cerr << n << " begin:\n";
        // for (re int i = 0;i < n;i++) cerr << res[i] << " "; cerr << "\n";
        for (re int i = 0;i < n;i++) res[i] = Mul(res[i],inv[6]);
    }
    dp[n] = res;
}

signed main(){
    n = read();
    for (re int i = 1;i <= 6;i++) inv[i] = qmi(i,mod - 2);
    dfs(n);
    for (re int i = 0;i < n;i++) printf("%lld\n",dp[n][i]);
    return 0;
}