#include #include #define rep(i,b) for(int i=0;i=0;i--) #define rep1(i,b) for(int i=1;i using mpq = priority_queue, greater>; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b ll sumv(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}} #define dame { cout << "No" << endl; return 0;} #define dame1 { cout << -1 << endl; return 0;} #define test(x) cout << "test" << x << endl; #define deb(x,y) cout << x << " " << y << endl; #define deb3(x,y,z) cout << x << " " << y << " " << z << endl; #define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl; #define out cout << ans << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define show(x) cerr<<#x<<" = "<; using pil = pair; using pli = pair; using pii = pair; using tp = tuple; using vi = vector; using vl = vector; using vs = vector; using vb = vector; using vpii = vector; using vpli = vector; using vpll = vector; using vpil = vector; using vvi = vector>; using vvl = vector>; using vvs = vector>; using vvb = vector>; using vvpii = vector>; using vvpli = vector>; using vvpll = vector; using vvpil = vector; using mint = modint998244353; using vm = vector; using vvm = vector>; vector dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; int main(){ int n; cin>>n; vm dp(2*n+1); rep1(i,2*n+1){ string s = to_string(i); int k = i - (sz(s)); int nj = k + n; if (nj < 0) continue; if (nj >= 2*n+1) continue; dp[nj] += 1; } // rep(i,2*n+1){ // show(i); // cout << dp[i].val() << endl; // } rep(i,n-1){ vm tmp(2*n+1); swap(tmp , dp); rep1(ii,2*n+1){ string s = to_string(ii); int k = ii - (sz(s)+1); rep(j,2*n+1){ int nj = k + j; if (nj < 0) continue; if (nj >= 2*n+1) continue; dp[nj] += tmp[j]; } } // show(i); // rep(j,2*n+1){ // show(j); // cout << dp[j].val() << endl; // } } cout << dp[n].val() << endl; return 0; }