#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  long long mod = 998244353;
  cin >> n;
  vector<long long> ans(n, 0);
  vector<long long> a(n, 0);
  vector<long long> r(n, 0);
  long long pow = 10;
  for (int i = 0; i < n; i++) {
    r[i] = (pow * (i + 1)) % mod;
    pow *= 10;
    pow %= mod;
  }
  ans[0] = 10;
  a[0] = 10;
  for (int i = 1; i < n; i++) {
    ans[i] = (r[i] + (mod - r[i - 1]) + (mod - a[i - 1])) % mod;
    a[i] = (ans[i] + a[i - 1]) % mod;
  }
  for (int i = n - 1; i >= 0; i--) cout << ans[i] << " ";
  return 0;
}
