#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=998244353,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

ll dp[222][1111];

void Main() {
  ll n,M=500;
  cin >> n;
  dp[0][M-n+1]=1;
  rep(i,n) {
    rep(j,1111) {
      REP(x,1,1111) {
        ll k=1;
        if(x>=10) k=2;
        if(x>=100) k=3;
        if(x>=1000) k=4;
        if(j+x-k>=0&&j+x-k<=1000) {
          dp[i+1][j+x-k]+=dp[i][j];
          dp[i+1][j+x-k]%=MAX;
        }
      }
    }
  }
  pr(dp[n][M]);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}