#include<bits/stdc++.h>
#include<bitset>
#include<unordered_set>
#define ll long long
using namespace std;
#define pii pair<int,int>
#define pll pair < ll, ll >
ll inv[10000005];
ll fac[10000005];
ll mod = 998244353;
ll qpow(ll a,ll k,ll mod)
{
    ll res=1;
    while(k)
    {
        if(k&1)
        res=res*a%mod;
        k/=2;
        a=a*a%mod;
    }
    return res;
}
ll C(ll n,ll m)
{
	ll res=(1ll*fac[n]*inv[m])%mod;
	return (1ll*res*inv[n-m])%mod;
}
int main()
{

    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //此为1-n逆元处理
    ll maxn = 1e7;
    fac[0]=1;
	for(register int i=1;i<=maxn;++i)
		fac[i]=(1ll*fac[i-1]*i)%mod;
        inv[maxn]=qpow(fac[maxn],mod-2,mod);
	for(register int i=maxn-1;i>=0;--i)
		inv[i]=(1ll*inv[i+1]*(i+1))%mod;
    int n;
    cin >> n;
    ll res = 0;
    for (int i = 1; i <= n;i++)
    {
        if(i+i-1>n)
            break;
        ll tmp= C(n-i,i-1) * fac[n - i];
       // cout << tmp << endl;
        tmp %= mod;
        tmp *= fac[i - 1];
        tmp %= mod;
        res+=tmp;
        res %= mod;
    }

        cout << res << endl;
}