#ifndef DEBUG
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast,unroll-loops")
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define vc vector
#define ll long long
using namespace std;
using namespace atcoder;
using mint = modint998244353;
constexpr int INF = 1e5 + 2023;
mint fac[INF + 1];
mint fin[INF + 1];
void solve()
{
	fac[0] = 1;
	for (int i = 1; i <= INF; i++)
		fac[i] = i * fac[i - 1];
	fin[INF] = fac[INF].inv();
	for (int i = INF; i > 0; i--)
		fin[i - 1] = i * fin[i];
	int n;
	cin >> n;
	for (int i = 0; i <= n; i++)
	{
		mint ans = mint(i).pow(n - i) * fin[n - i];
		if ((n - i) % 2)
			ans *= -1;
		cout << ans.val() << '\n';
	}
}
int main()
{
	// srand((unsigned)time(NULL));
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(13);
	solve();
	return 0;
}