#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 2e5 + 5;
const ll mod = 998244353;
ll ans[N];
ll n;
ll add(ll x, ll y) { return (x + y) % mod; }
ll mul(ll x, ll y) { return (x * y) % mod; }
ll power(ll x, ll y) {
  ll res = 1;
  while (y > 0) {
    if (y & 1) res = mul(res, x);
    x = mul(x, x);
    y /= 2;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    if (i == n) {
      ans[i] = 10;
      continue;
    }
    if (n >= i + 2) {
      int can = n - i - 1;
      ans[i] = mul(can, 10);
      ans[i] = mul(ans[i], 81);
      ans[i] = mul(ans[i], power(10, n - i - 2));
    }
    ans[i] = add(ans[i], mul(180, power(10, n - i - 1)));
  }
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << " ";
  }
  cout << "\n";
  return 0;
}
