#include <bits/stdc++.h>
using namespace std;
#if __has_include("all.hpp")
#include "all.hpp"
#else
#include <atcoder/all>
#endif
using namespace atcoder;
using mint=modint998244353;
int main(void){
    int n;
    cin>>n;
    vector<mint>fact(10001,1);
    for(int i=1;i<10001;i++)fact[i]=fact[i-1]*i;
    mint ans=0;
    auto nCk = [&](int n2,int k){
        return fact[n2]/fact[k]/fact[n2-k];
    };
    for(int i=0;i<=n;i++){
        //cout<<i*2-1<<" "<<i*2-1+i+1<<endl;
        if(i*2-1>n||i*2-1+i+1<n)continue;
        //cout<<i<<" "<<n-(i*2-1)<<" "<<i*2-1+i+1-n<<endl;
        ans+=nCk(i+1,i*2-1+i+1-n)*fact[i]*fact[n-i];
    }
    cout<<ans.val()<<endl;
    return 0;
}