#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5 + 5;
const int inf = (int)1e9;
const int mod = (int)998244353;
int n, pw[N], ans[N];
int main() {
  cin >> n;
  pw[0] = 1;
  for (int i = 1; i <= n; i++) {
    pw[i] = pw[i - 1] * 10ll % mod;
  }
  ans[n] = 10;
  for (int i = 1; i < n; i++) {
    ans[i] += 2ll * 90 * pw[n - i - 1] % mod;
    ans[i] %= mod;
    ans[i] += (n - i + 1 - 2ll) * 90ll % mod * 9ll % mod * pw[n - i - 2] % mod;
    ans[i] %= mod;
  }
  for (int i = 1; i <= n; i++) printf("%d%c", ans[i], " \n"[i == n]);
  return 0;
}
