#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=1e7+7;
ll mod=998244353LL;
ll sum[MAXN],inv[MAXN];
int n;
inline ll ksm(ll x,ll y)
{
    ll res=1LL;
    while(y)
    {
        if(y&1LL) res=(res*x)%mod;
        x=(x*x)%mod;y=y>>1LL;
    }
    return res;
}
inline ll A(int x,int y)
{
    if(y>x) return 0;
    ll res=sum[x]*inv[x-y];
    return res%mod;
}
int main()
{
    cin>>n;
    sum[0]=1LL;
    for(int i=1;i<=n;i++) sum[i]=(sum[i-1]*(ll) i)%mod;
    inv[n]=ksm(sum[n],mod-2LL);
    for(int i=n-1;i>=1;i--) inv[i]=(inv[i+1]*(ll) (i+1LL))%mod;
    inv[0]=1LL;
    ll ans=0LL;
    for(int i=1;i<=n;i++)
    {
        ans+=A(n-i,i-1)*sum[n-i];
        ans%=mod;
    }
    cout<<ans;
    return 0;
}