#include <bits/stdc++.h>
#define ll long long
#define Ma 10000007
#define mod 998244353
using namespace std;
ll mul[Ma],pre[Ma];

ll po(ll p,ll x=mod-2)
{
    ll sum=1;
    while (x)
    {
        if (x&1) sum=sum*p%mod;
        p=p*p%mod;
        x>>=1;
    }
    return sum;
}

void pri()
{
    mul[0]=pre[0]=1;
    for (ll i=1;i<Ma;i++)
        mul[i]=mul[i-1]*i%mod;
    pre[Ma-1]=po(mul[Ma-1]);
    for (ll i=Ma-2;i>=0;i--)
        pre[i]=pre[i+1]*(i+1)%mod;
    return;
}

ll C(ll x,ll y){
    if (x<0||y<0||x>y) return 0;
    return mul[y]*pre[x]%mod*pre[y-x]%mod;
}


ll n;

void sol()
{
    cin>>n;
    ll ans=0;
    for (ll i=1;i<=n;i++)
    {
        ans=(ans+C(i-1,n-i)*mul[i-1]%mod*mul[n-i]%mod)%mod;
    }
    printf("%lld\n",ans);
}

int main()
{
    pri();
    ios::sync_with_stdio(0); cin.tie(0);
    ll tt=1;
    //cin>>tt;
    while (tt--)
        sol();
    return 0;
}