#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include<bits/stdc++.h>
using namespace std;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;//B(n,V<int>(n))

const int MOD=998244353;
ll A[1010][1010];
ll B[1010][1010];

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int n;
  cin>>n;
  if(n%2){
    cout<<0<<endl;
    return 0;
  }
  A[0][0]=1,B[n/2][n/2]=1;
  rep(i,n/2+1) rep(j,n/2+1){
    if(i>j) continue;
    if(i) A[i][j]=(A[i][j]+A[i-1][j])%MOD;
    if(j) A[i][j]=(A[i][j]+A[i][j-1])%MOD;
  }
  for(int i=n/2;i>=0;i--) for(int j=n/2;j>=0;j--){
    if(i>j) continue;
    if(i<n/2) B[i][j]=(B[i][j]+B[i+1][j])%MOD;
    if(j<n/2) B[i][j]=(B[i][j]+B[i][j+1])%MOD;
  }
  ll ans=0;
  rep(i,n/2+1) rep(j,n/2+1){
    if(j-i<2) continue;
    ans=(ans+A[i][j]*B[i+1][j]%MOD*(j-i-1)%MOD)%MOD;
  }
  cout<<ans<<endl;
  
  return 0;
}