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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod = 998244353;
int add(int a, int b)
{
	return a + b < mod ? a + b : a + b - mod;
}
int sub(int a, int b)
{
	return a - b >= 0 ? a - b : a - b + mod;
}
int mult(int a, int b)
{
	return (LL) a * b % mod;
}
int binpow(int a, int n)
{
	int res = 1;
	while(n)
	{
		if(n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n /= 2;
	}
	return res;
}

map<int, VI> dp;
const int ml6 = binpow(6, mod - 2);

LL sum = 0;

void solve(int n)
{
	if(dp.count(n))
		return;
	sum += n;

	if(n <= 6)
	{
		VI res(n, binpow(n, mod - 2));
		dp[n] = res;
        // cerr << n << " " << binpow(n,mod - 2) << " ???\n";
		return;
	}
	
    solve(5 * n / 6);
    solve(5 * n / 6 + 1);
    VI a = dp[5 * n / 6],b = dp[5 * n / 6 + 1];
	
	VI res(n);
	
	FOR(j, 0, 6)
	{
		int cnt = 0;
		FOR(i, 0, n)
		{
			if(i % 6 == j)
				continue;
			if(j < n % 6)
				res[i] = add(res[i], a[cnt]);
                // ,cerr << i << " " << cnt << " " << a[cnt] << " first\n";
			else
				res[i] = add(res[i], b[cnt]);
                // ,cerr << i << " " << cnt << " " << b[cnt] << " second\n";
			cnt++;
		}
	}
    // cerr << n << " begin:\n";
    // FOR(i, 0, n) cerr << res[i] << " "; cerr << "\n";
	FOR(i, 0, n)
		res[i] = mult(res[i], ml6);
    // cerr << "\n";
	dp[n] = res;
}



int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);

	int n;
	cin >> n;

	solve(n);
	VI res = dp[n];
	FOR(i, 0, n)
	{
		cout << res[i] << "\n";
	}
	//cerr << sum << "\n";

	
	return 0;
}