#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const ll MOD = 998244353, N = 2e5 + 10;
ll power(ll x, ll y) {
  ll ans = 1;
  if (y == 1) return x % MOD;
  x = x % MOD, y = y % (MOD - 1);
  while (y) {
    if (y & 1) ans = (ans * x) % MOD;
    x *= x;
    x = x % MOD;
    y >>= 1;
  }
  return ans;
}
ll inv(ll x) { return power(x, MOD - 2); }
ll fact[N];
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  ll n;
  cin >> n;
  fact[0] = 1;
  for (ll i = 1; i < N; i++) {
    fact[i] = fact[i - 1] * i;
    fact[i] %= MOD;
  }
  vector<ll> ans = {10};
  ll cur = 10, tot = 0;
  for (ll i = n - 1; i >= 1; i--) {
    ll tt = n - i + 1;
    ll res = (power(10, tt) * tt) % MOD;
    tot += cur;
    tot %= MOD;
    res -= (tot + cur);
    while (res < MOD) res += MOD;
    res %= MOD;
    cur += res;
    cur %= MOD;
    ans.push_back(res);
  }
  reverse(ans.begin(), ans.end());
  for (ll i = 0; i < n; i++) {
    cout << ans[i] << ' ';
  }
  cout << '\n';
  return 0;
}
