#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const long long int md = 998244353;
const long long MAX = LONG_MAX;
const long long lrg = 1000000007;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(char ch) {
  string s;
  s += ch;
  return s;
}
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
long long power(long long a, long long n) {
  long long cp = n;
  long long vl = 1, ac = a;
  while (cp > 0) {
    if (cp % 2 != 0) {
      vl = (vl * ac) % md;
    }
    ac = (ac % md * ac % md) % md;
    cp /= 2;
  }
  return vl;
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> v;
  v.push_back(10);
  for (long long i = 1; i < n; i++) {
    long long c1 = (v[v.size() - 1] * 10);
    long long c2 = (i > 0 ? 9 : 1) * power(10, max(0LL, i));
    long long c3 =
        (i > 0 ? 10 : 0) * (i - 1 > 0 ? 9 : 1) * power(10, max(0ll, i - 2));
    v.push_back((c1 + c2 - c3 + 1000 * md) % md);
  }
  for (long long i = v.size() - 1; i >= 0; --i) {
    cout << v[i] << " ";
  }
}
int main() {
  int t = 1;
  while (t--) solve();
  return 0;
}
