#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define repi(i,m,n) for(int i=(int)m; i<=(int)n; i++)
#define rrep(i,n) for(int i=(int)n-1; i>=0; i--)
#define rrepi(i,m,n) for(int i=(int)n; i>=(int)m; i--)
#define all(x) x.begin(),x.end()
template <typename T> inline bool chmin(T& a, const T& b) { return a > b ? a = b, true : false; };
template <typename T> inline bool chmax(T& a, const T& b) { return a < b ? a = b, true : false; };
template <typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}
using ll = long long;

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main(){
    int n; cin >> n;

    if(n%2){
        cout << 0 << endl;
        return 0;
    }

    mint ans = 0;
    vector<vector<mint>> dp(n+1,vector<mint> (n+1,0));
    dp[0][0] = 1;
    repi(i,1,n) repi(j,0,n) if(j <= i && j <= n-i){
        if(j > 0) dp[i][j] += dp[i-1][j-1];
        dp[i][j] += dp[i-1][j+1];
    }
    repi(i,1,n) repi(j,0,n) if(j <= i && j <= n-i){
        ans += dp[i-1][j+1]*j*dp[n-i][j];
    }

    cout << ans.val() << endl;
    
    return 0;
}