#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const int INF2 = 0x3f3f3f3f;
const long long INF64 = 1e18;
const double INFD = 1e30;
const double EPS = 1e-9;
const double PI = acos(-1);
const int MOD = 998244353;
template <typename T>
inline T read() {
  T X = 0, w = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    w |= ch == '-';
    ch = getchar();
  }
  while (isdigit(ch)) X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
  return w ? -X : X;
}
const int MAXN = 200005;
int n, m, k;
int dr[4] = {1, 0, -1, 0};
int dc[4] = {0, 1, 0, -1};
int dr2[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int dc2[8] = {1, 0, -1, 1, 0, -1, 1, -1};
int CASE = 1;
long long b[MAXN];
long long ans[MAXN], suf[MAXN];
int main() {
  scanf("%d", &n);
  b[0] = 1;
  for (int i = 1; i <= 200000; i++) {
    b[i] = (b[i - 1] * 10) % MOD;
  }
  long long cur = 0, tot = 0;
  for (long long i = n; i >= 1; i--) {
    cur = (cur + suf[i + 1]) % MOD;
    tot = (long long)(n - i + 1) * b[n - i + 1] % MOD;
    ans[i] = (tot - cur + MOD) % MOD;
    cur = (cur + ans[i]) % MOD;
    suf[i] = (suf[i + 1] + ans[i]) % MOD;
  }
  for (int i = 1; i <= n; i++) {
    printf("%lld ", ans[i]);
  }
  return 0;
}
