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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); 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 = 998'244'353;

void updAdd(int& a, int b)
{
	a += b;
	if (a >= mod)
		a -= mod;
}

int mult(int a, int b)
{
	return (LL)a * b % mod;
}

const int inv[7] = {0, 1, 499122177, 332748118, 748683265, 598946612, 166374059};
unordered_map<int, VI> dp;

void f(int n)
{
	VI& cur = dp[n];
	cur.resize(n);
	for (int m : {n - n / 6, n - (n + 5) / 6})
	{
		if (!dp.count(m))
			f(m);
	}
	FOR(i, 0, n)
	{
		int iMod6 = i % 6;
		int c = min(n, 6);
		FOR(x, 0, c)
		{
			if (x == iMod6)
				continue;
			int j = i - (i - x + 5) / 6;
			int m = n - (n - x + 5) / 6;
			updAdd(cur[i], mult(inv[c], dp[m][j]));
		}
	}
}

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	int n;
	cin >> n;
	dp[1] = {1};
	f(n);
	for (int x : dp[n])
		cout << x << "\n";
	return 0;
}