#include <bits/stdc++.h>
using namespace std;
int MOD = 998244353;
void solve() {
  long long n;
  cin >> n;
  vector<long long> dp(n + 2);
  dp[0] = 1;
  vector<long long> power(n + 2);
  power[0] = 1;
  power[1] = 1;
  for (long long i = 2; i < (n + 2); i++) {
    power[i] = (power[i - 1] * 10) % MOD;
  }
  for (long long i = 1; i < (n); i++) {
    dp[i] = (9 * power[n + 1 - i] * 2 % MOD);
    dp[i] = (dp[i] + (n - i - 1) * 9 * 9 * power[n - i]) % MOD;
  }
  dp[n] = 10;
  for (long long i = 1; i < (n + 1); i++) {
    if (i != 1) cout << " ";
    cout << dp[i];
  }
  cout << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  long long t = 1;
  while (t--) {
    solve();
  }
}
