#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);
const int MAX_N = 6000;
vector<mint> fac(MAX_N), finv(MAX_N), inv(MAX_N);
void init(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i=2;i<MAX_N;++i){
        fac[i] = fac[i-1] * i;
        inv[i] = MOD - inv[MOD%i] * (MOD/i);
        finv[i] = finv[i-1] * inv[i];
    }
}
mint catalan(int n){
    return fac[2*n] * finv[n+1] * finv[n];
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    init();
    int n;
    cin >> n;
    if(n&1){
        cout << "0\n";
        return 0;
    }
    n /= 2;
    vector<mint> dp(n+1,0);
    for(int i=2;i<=n;++i){
        dp[i] = dp[i-1] + (i-1) * catalan(i-1);
        for(int j=1;j<i;++j) dp[i] += dp[j]*catalan(i-j) + dp[i-j]*catalan(j);
    }
    cout << dp[n].val() << '\n';
    return 0;
}