#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long n;
long long mul(long long x, long long y) {
  long long res = ((x % MOD) * (y % MOD)) % MOD;
  return res;
}
long long add(long long x, long long y) {
  long long res = ((x % MOD) + (y % MOD)) % MOD;
  return res;
}
long long binpow(long long a, long long b) {
  a %= MOD;
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
int32_t main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  if (n == 1)
    cout << "10\n";
  else {
    for (long long i = 1; i <= n; i++) {
      long long ans = 0, ans1 = 1, ans2 = 810;
      long long seg = n - i + 1;
      long long exp1 = seg - 2;
      if (exp1 < 0)
        ans1 = 0;
      else {
        long long p1 = binpow(10, exp1);
        ans1 = mul(180, p1);
      }
      long long exp2 = n - i - 2;
      if (exp2 < 0)
        ans2 = 0;
      else {
        long long p2 = binpow(10, exp2);
        ans2 = mul(ans2, n - i - 1);
        ans2 = mul(ans2, p2);
      }
      ans = add(ans1, ans2);
      if (i == n) ans = 10;
      cout << ans % MOD << " ";
    }
    cout << "\n";
  }
  return 0;
}
