#include <bits/stdc++.h>
using namespace std;
long long pw[200005], n, mod = 998244353;
int main() {
  cin >> n;
  pw[0] = 1;
  for (long long i = (1); i <= (n); ++i) pw[i] = pw[i - 1] * 10 % mod;
  for (long long i = (1); i <= (n); ++i) {
    long long tmp = n - i, ans;
    if (tmp == 0)
      ans = 10;
    else if (tmp == 1)
      ans = 10 * 9 * 2;
    else {
      ans = 10 * 9 * pw[tmp - 1] * 2;
      ans %= mod;
      ans += 10 * (tmp - 1) * 9 * 9 % mod * pw[tmp - 2] % mod;
      ans %= mod;
    }
    cout << ans % mod << " ";
  }
  return 0;
}
