text: #include<cstdio>
  #include<algorithm>
  #include<cstring>
  #include<iostream>
  #include<vector>
  #include<queue>
  #include<cmath>
  #include<map>
  #include<set>
  #define ll long long
  #define F(i,a,b) for(int i=(a);i<=(b);i++)
  #define mst(a,b) memset((a),(b),sizeof(a))
  #define PII pair<int,int>
  #define rep(i,x,y) for(auto i=(x);i<=(y);++i)
  #define dep(i,x,y) for(auto i=(x);i>=(y);--i)
  using namespace std;
  template<class T>inline void rd(T &x) {
    x=0; int ch=getchar(),f=0;
    while(ch<'0'||ch>'9'){if (ch=='-') f=1;ch=getchar();}
    while (ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
    if(f)x=-x;
  }
  const int inf=0x3f3f3f3f;
  const ll p=998244353;
  ll n;
  ll ksm(ll a,ll b)
  {
    if(b<0) return 0;
    ll res=1;
    while(b)
    {
      if(b&1) res=(res*a)%p;
      a=(a*a)%p;
      b>>=1;
    }
    return res;
  }
  int main()
  {
    cin>>n;
    rep(i,1,n-1)
    {
      ll temp=2*10*9*ksm(10,n-i-1)%p;
      temp=(temp+(n-i-1)*10*9*9%p*ksm(10,n-i-2)%p)%p;
      printf("%lld ",temp);
    }
    printf("10\n");
    return 0;
  }