#include <bits/stdc++.h>
using namespace std;
const unsigned long long MAXN = 2e5 + 7;
long long INF = 998244353;
unsigned long long t, n, d, m;
unsigned long long a[MAXN], b[MAXN];
int main(int argc, char const *argv[]) {
  unsigned long long sum = 0;
  cin >> n;
  a[0] = 1;
  b[0] = 1;
  for (unsigned long long i = 1; i <= n; i++) {
    a[i] = (a[i - 1] * i) % INF;
  }
  for (unsigned long long i = 1; i <= n; i++) b[i] = (b[i - 1] * 10) % INF;
  for (unsigned long long i = n; i >= 1; i--) {
    if (i > 2) {
      sum = (10 * 9 * b[i - 2] * 2) % INF;
      sum = (sum + 10 * 9 * 9 * b[i - 3] * (i - 2)) % INF;
      cout << sum << " ";
    } else if (i == 2) {
      cout << 180 << " ";
    } else
      cout << 10 << " ";
  }
  return 0;
}
