#include <bits/stdc++.h> using namespace std; #include <atcoder/all> using namespace atcoder; using mint = atcoder::static_modint<998244353>; // using mint = atcoder::static_modint<1000000007>; using ld = long double; using ll = long long; #define mp(a,b) make_pair(a,b) #define rep(i,s,n) for(int i=s; i<(int)n; i++) const vector<int> dx{1,0,-1,0},dy{0,1,0,-1}; template<class T> struct Factorial{ Factorial(int _n):fac(_n+1,1),invfac(_n+1,1){ for(int i=1; i<=_n; i++){ fac[i]=fac[i-1]*i; invfac[i]/=fac[i]; } }; T nCr(int n,int r){ if(0<=r && r<=n)return fac[n]*invfac[r]*invfac[n-r]; else return 0; } T nPr(int n,int r){ if(0<=r && r<=n)return fac[n]*invfac[n-r]; else return 0; } T sum(int a,int b){ // \Sigma_{i\in[0,a],j\in[0,b]}(i+j)Ciを計算 return nCr(a+b+2,a+1)-1; } vector<T> fac,invfac; }; int main(){ int n;cin >> n; if(n&1){ cout << 0; return 0; } Factorial<mint> F(10000); vector<mint> dp(n+1); vector<mint> p(n+1); for(int i=2; i<=n; i+=2)p[i]=F.nCr(i,i/2)-F.nCr(i,i/2-1); for(int i=4; i<=n; i+=2){ for(int j=2; j<i; j+=2)dp[i]+=dp[j]*p[i-j]+dp[i-j]*p[j]; dp[i]+=p[i-2]*(i-2)/2; } cout << dp[n].val(); }