#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int mod = 998244353;
vector<int> ans;
int main() {
  int n;
  cin >> n;
  ans.resize(n);
  LL num = 1, exlu = 0, sum = 0;
  for (int i = 1; i <= n; i++) {
    int &t = ans[i - 1];
    num = (num * 10) % mod;
    t = (num * i - exlu) % mod;
    sum = (sum + t) % mod;
    exlu = (exlu + sum + t) % mod;
  }
  for (auto i = ans.rbegin(); i != ans.rend(); i++)
    cout << (*i + mod) % mod << ' ';
  return 0;
}
