#include<iostream>
#define ll long long
#include<algorithm>
#include<vector>
#include<iomanip>
#include<map>

const double eps = 1e-4;
const ll mod = 998244353;

ll exgcd(ll a, ll b, ll& x, ll& y) 
{ 
    if (b == 0) return x = 1, y = 0, a; 
    ll r = exgcd(b, a % b, x, y); 
    std::tie(x, y) = std::make_tuple(y, x - (a/b)*y); 
    return r; 
}

ll niyuan(ll n,ll mod)
{
    ll x,y;
    ll r=exgcd(n,mod,x,y);
    x=(x%mod+mod)%mod;
    return x;
}

void solve()
{
    ll n;
    std::cin>>n;
    ll x=1;
    ll ans=0;
    std::vector<ll> v(n+1);
    v[0]=1;
    for(int i=1;i<=n;i++)
    {
        x*=i;
        x%=mod;
        v[i]=x;
    }
    for(int i=1;i<=(n+1)/2;i++)
    {
        ll a =((v[n-i]*niyuan(v[n-i - (i-1)],mod))%mod) * v[n-(i)]%mod;
        //std::cout<<n-i<<" "<<n-i - (i-1)<<" "<<n-(i-1)<<"\n";
        ans+=a;
        ans%=mod;
    }
    std::cout<<ans<<"\n";

}

int main(){
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);
    ll test=1;
    //std::cin>>test;
    while(test--){
        solve();
    }
}