#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
template <typename T>
T modpow(T base, T exp, T modulus) {
  base %= modulus;
  T result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result * base) % modulus;
    base = (base * base) % modulus;
    exp >>= 1;
  }
  return result;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  for (long long i = 1; i < n - 1; i++) {
    long long out =
        (10ll * 2ll * 9ll * modpow(10ll, n - i - 1ll, 998244353ll)) %
        998244353ll;
    out +=
        (81ll * 10ll * modpow(10ll, n - i - 2ll, 998244353ll) * (n - 1ll - i)) %
        998244353ll;
    out %= 998244353ll;
    cout << out << "\n";
  }
  if (n > 1) cout << ((10ll * 2ll * 9ll) % 998244353ll) << "\n";
  cout << "10\n";
}
