#include <bits/stdc++.h>
using namespace std;
long long recur_depth = 0;
template <typename Ostream, typename Cont>
typename enable_if<is_same<Ostream, ostream>::value, Ostream&>::type operator<<(
    Ostream& os, const Cont& v) {
  os << "[";
  for (auto& x : v) {
    os << x << ", ";
  }
  return os << "]";
}
template <typename Ostream, typename... Ts>
Ostream& operator<<(Ostream& os, const pair<Ts...>& p) {
  return os << "{" << p.first << ", " << p.second << "}";
}
const long long mod = 998244353;
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long extend_gcd(long long a, long long b, long long& x, long long& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long x1, y1;
  long long d = extend_gcd(b, a % b, x1, y1);
  x = y1;
  y = x1 - y1 * (a / b);
  return d;
}
long long modinv(long long a, long long p) { return power(a, p - 2, p); }
long long rowNum[] = {-1, 0, 0, 1};
long long colNum[] = {0, -1, 1, 0};
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, ans = 0;
  cin >> n;
  std::vector<long long> res;
  for (long long i = 1; i < n; i++) {
    ans = (n - i - 1) * power(9, 2, mod) * power(10, n - i - 1, mod);
    ans += (2 * 9 * power(10, n - i, mod));
    ans %= mod;
    res.push_back(ans);
  }
  for (auto x : res) cout << x << " ";
  cout << 10 << endl;
}
