#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long pw[200007];
long long sv[200007];
int n;
int main() {
  scanf("%d", &n);
  pw[0] = 1;
  for (int i = 1; i <= n; i++) {
    pw[i] = (pw[i - 1] * 10) % mod;
  }
  sv[n] = 10;
  for (int i = 1; i < n; i++) {
    sv[i] = (9 * pw[n - i - 1]) % mod;
    if (i < n) sv[i] = (sv[i] + sv[i]) % mod;
    if (i < n - 1)
      sv[i] =
          (((n - i - 1) * ((9 * 9 * pw[n - i - 2]) % mod)) % mod + sv[i]) % mod;
    sv[i] = (sv[i] * 10) % mod;
    printf("%lld ", sv[i]);
  }
  printf("10\n");
  return 0;
}
