#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<long long> pows(n + 1);
  pows[0] = 1;
  for (int i = 0; i < (int)(n); i++) {
    pows[i + 1] = pows[i] * 10 % mod;
  }
  for (int i = 1; i <= n; i++) {
    long long ret = 0;
    if (n - i >= 2) {
      long long tmp = 9 * 9 * pows[n - 2 - i + 1] % mod;
      tmp = tmp * (n - 2 - i + 1) % mod;
      ret = (ret + tmp) % mod;
    }
    if (n - i >= 1) {
      long long tmp = 9 * pows[n - 1 - i + 1] % mod;
      tmp = tmp * 2 % mod;
      ret = (ret + tmp) % mod;
    }
    if (i == n) ret = (ret + 10) % mod;
    cout << ret << " ";
  }
  cout << endl;
}
