#include <iostream>
#include <cmath>

using namespace std;
using ll = long long;
// #define int long long
const int mod = 998244353;
const int maxn = 1e6 + 10;
ll f[maxn],g[maxn];

ll qpow(ll n, ll m)
{
    n%=mod;
    ll res = 1;
    while(m)
    {
        if(m&1)
        {
            res = res*n%mod;
        }
        n = n*n%mod;
        m>>=1;
    }
    return res;
}
void init(void)
{
    f[0]=1;
    for(int i=1;i<maxn;i++)
    {
        f[i]=f[i-1]*i%mod;
    }
    g[maxn-1]=qpow(f[maxn-1],mod-2);
    for(int i=maxn-2;i>=1;i--)
    {
        g[i]=g[i+1]*(i+1)%mod;
    }
}
ll C(int n, int m)
{
    if(m==0||m==n)
    {
        return 1;
    }
    if(m<=0 || n < m)
    {
        return 0;
    }
    else
    {
        return f[n]*g[m]%mod*g[n-m]%mod;
    }
}
signed main()
{
    init();
    int n;
    cin >> n;

    ll ans = 0;
    for (int i = 1; i <= n; i++)
    {
        ans += C(n - i, i - 1) * f[i - 1] % mod * f[n - i] % mod;
        ans %= mod;
    }
    cout << ans << '\n';
    return 0;
}