#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;

const int N = 374747;
unordered_map<int, int> dp[N];

int add(int a, int b)
{
	return a + b < mod ? a + b : a + b - mod;
}
int mult(int a, int b)
{
	return (LL) a * b % mod;
}
int binpow(int a, int p)
{
	int ans = 1;
	while (p)
	{
		if (p & 1) ans = mult(ans, a);
		a = mult(a, a);
		p /= 2;
	}
	return ans;
}
int inv(int a)
{
	return binpow(a, mod - 2);
}
int i6;

int f(int n, int i)
{
	//cerr << n << ' ' << i << '\n';
	if (n == 0 && i == 0)
	{
		exit(0);
	}
	if (dp[n].count(i))
		return dp[n][i];
	
	int ans = 0;
	FOR (d, 0, 6)
	{
		if (i % 6 == d) continue;
		int dbe = i / 6 + ((i % 6) > d);
		int dal = n / 6 + ((n % 6) > d);
		ans = add(ans, mult(i6, f(n - dal, i - dbe)));
	}
	dp[n][i] = ans;
	return ans;
}

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

	i6 = inv(6);
	
	int n;
	cin >> n;
	FOR (i, 1, 7)
	{
		FOR (m, 0, i)
		{
			dp[i][m] = inv(i);
		}
	}
	FOR (i, 0, n)
	{
		cout << f(n, i) << '\n';
	}
	
	
	return 0;
}