#include <bits/stdc++.h>

using namespace std;
#define ll long long
const int N = 10000010;
const int mod = 998244353;
ll jc[N + 1];
ll iv[N + 1];
ll ivjc[N + 1];

void init() {
    jc[0] = jc[1] = 1;
    iv[0] = iv[1] = 1;
    ivjc[0] = ivjc[1] = 1;
    for (int i = 2; i <= N; i++) {
        jc[i] = jc[i - 1] * i % mod;
        iv[i] = (mod - mod / i) * iv[mod % i] % mod;
        ivjc[i] = ivjc[i - 1] * iv[i] % mod;
    }
}

ll C(ll n, ll m) {
    if (n < m)return 0;
    else return jc[n] * ivjc[m] % mod * ivjc[n - m] % mod;
}
ll A(ll n, ll m)
{
    if(n<m) return 0;
    else return jc[n] * ivjc[n-m] % mod;
}
int main()
{
    init();
//    cout<<A(2,1)<<" "<<A(2,2);
    int n;
    cin>>n;
    if(n==1)
    {
        cout<<1;
        return 0;
    }
    ll ans=0;
    for(int i=n;i>=1;i--)
    {
//        cout<<A(n-i,i-1)*A(n-i,n-i)<<"\n";
        ans=(ans+(jc[n-1]-A(n-i,i-1)*A(n-i,n-i)%mod)%mod+mod)%mod;
    }
    cout<<((jc[n]-ans)%mod+mod)%mod;
    return 0;
}