#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
long long a[200005];
int c, n, m, k, l, r, cur, ans, t, tmp, T;
char s[300];
const int M = 998244353;
int test() {
  int n = 4;
  int m = 10000;
  for (int i = 0; i < m; ++i) {
    sprintf(s, "%04d", i);
    int st = 0;
    for (int j = 0; j < n; ++j) {
      if (j == n - 1 || s[j] != s[j + 1]) {
        a[j - st + 1]++;
        st = j + 1;
      }
    }
  }
  for (int i = 1; i <= n; ++i) printf("%d %I64d\n", i, a[i]);
}
int work() {
  scanf("%d", &n);
  a[1] = 10;
  long long t = 0;
  long long m = 0;
  long long p = 10;
  for (int i = 2; i <= n; ++i) {
    p = p * 10 % M;
    long long s = i * p % M;
    t = (t + a[i - 1]) % M;
    m = (m + t + a[i - 1]) % M;
    a[i] = (s - m + M) % M;
  }
  for (int i = 1; i <= n; ++i) printf("%I64d ", a[n + 1 - i]);
  printf("\n");
  return 0;
}
int main() {
  work();
  return 0;
}
