#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long binpow(long long x, long long n) {
  if (!n) return 1;
  if (n == 1) return x;
  long long a = binpow(x, n / 2);
  if (!(n % 2)) {
    return (a * a) % MOD;
  } else {
    return (a * ((a * x) % MOD)) % MOD;
  }
}
int32_t main() {
  long long t;
  t = 1;
  while (t--) {
    long long n;
    cin >> n;
    for (long long i = 1; i <= n; i++) {
      if (n == i)
        cout << 10;
      else {
        long long cur = (180 * (binpow(10, n - i - 1)) +
                         10 * (n - i - 1) * 81 * binpow(10, n - i - 2)) %
                        MOD;
        cout << cur << " ";
      }
    }
  }
  return 0;
}
