#include <bits/stdc++.h>
using namespace std;
typedef vector<pair<long long, long long> > vpll;
const int M = 2e5 + 7;
const int inf = 1e9;
const int mod = 998244353;
int n;
long long cant[M];
long long sum(long long a, long long b) { return (a + b) % mod; }
long long pro(long long a, long long b) { return (a * b) % mod; }
long long bp(long long a, int b) {
  if (b == 0) return 1;
  long long x = bp(a, b >> 1);
  x = pro(x, x);
  if (b & 1) return pro(a, x);
  return x;
}
void go() {
  cin >> n;
  for (int i = 1; i < n - 1; i++)
    cant[i] =
        sum(pro(18, bp(10, n - i)), pro(pro(81, bp(10, n - i - 1)), n - i - 1));
  cant[n - 1] = 180;
  cant[n] = 10;
  for (int i = 1; i < n + 1; i++) cout << cant[i] << " ";
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int tst = 1;
  while (tst--) go();
  return 0;
}
