#include <bits/stdc++.h>
using namespace std;
int dbg = 0;
const int N = 2e5 + 1;
const int lg = 20;
const long long mod = 998244353;
void solve() {
  vector<long long> t(N);
  t[0] = 1;
  for (int i = 1; i < N; i++) t[i] = (10 * t[i - 1]) % mod;
  long long sm = 20, add = 10;
  vector<long long> gen(N);
  gen[1] = 10;
  for (int i = 2; i < N; i++) {
    gen[i] = (i * t[i] - sm) % mod;
    if (gen[i] < 0) gen[i] += mod;
    (sm += gen[i]) %= mod;
    (add += gen[i]) %= mod;
    (sm += add) %= mod;
  }
  int n;
  cin >> n;
  for (int i = n + 1 - 1; i >= 1; i--) cout << gen[i] << " ";
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
