#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const long long mod = 998244353;
long long fpow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> ans(n + 1, 0);
  ans[1] = 10;
  long long sum = 10;
  long long val = 0;
  for (long long i = 2; i <= n; ++i) {
    long long t = fpow(10, i);
    t = t * i % mod;
    val = (val + sum + ans[i - 1]) % mod;
    t = (t - val) % mod;
    ans[i] = t;
    sum = (sum + ans[i] % mod) % mod;
  }
  for (long long i = n; i >= 1; --i) {
    ans[i] = (ans[i] % mod + mod) % mod;
    cout << ans[i] << ' ';
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  solve();
  return 0;
}
