#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define range(x) (x).begin(),(x).end()
const int dir[][2]={1,0,-1,0,0,1,0,-1};
const ll mod=998244353;

const ll N=10000005;
ll fac[N],ifac[N];
ll qpow(ll a,ll b)
{
    ll ans=1;
    for(;b;b>>=1){
        if(b&1)
            ans=ans*a%mod;
        a=a*a%mod;
    }

    return ans;
}
void solve()
{
    int n;
    cin>>n;

    fac[0]=1;
    for(int i=1;i<=n;++i)
        fac[i]=fac[i-1]*i%mod;

    ifac[n]=qpow(fac[n],mod-2);
    for(int i=n-1;~i;--i)
        ifac[i]=ifac[i+1]*(i+1)%mod;

    ll ans=0;
    for(int i=1;i<=(n+1)/2;++i){
        (ans+=fac[n-i]*fac[n-i]%mod*ifac[n-2*i+1]%mod)%=mod;
        // cout<<fac[n-i]*ifac[n-2*i+1]%mod<<'\n';
    }

    cout<<ans<<'\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}