#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define endl "\n"
#define PII pair<double,int>
// const int maxn=1e7+5;
// const int mod=998244353;
const int N = 1e7 + 3, mod = 998244353;
const int maxn = 25000001;
const int p = 998244353;
namespace CNM {
    const int N = 1e7 + 4;
    int fac[N], infac[N];
    int ksm(int x, int y) {
        int res = 1;
        while(y > 0) {
            if(y & 1)
                res = res * x % p;
            y >>= 1;
            x = x * x % p;
        }
        return res;
    }
    void init() {
        fac[0] = 1;
        for(int i = 1; i < N; i ++)
            fac[i] = fac[i - 1] * i % p;
        infac[N - 1] = ksm(fac[N - 1], p - 2);
        for(int i = N - 2; i >= 0; i --)
            infac[i] = infac[i + 1] * (i + 1) % p;
    }
    int C(int n, int m) {
        if(n < m || m < 0) return 0;
        return (fac[n] * infac[m] % p) * infac[n - m] % p;
    }
    int A(int n, int m) {
        if(n < m || m < 0) return 0;
        return fac[n] * infac[n - m] % mod;
    }
    int inv(int x,int p){
        return ksm(x,p-2)%p;
    }
}
// int A(int n, int m) {
//     return CNM::A(n, m);
// }
int C(int n,int m){
    return CNM::C(n,m);
}
int inv(int a,int b){
    return CNM::inv(a,b);
}
signed main(){
    // ios::sync_with_stdio(false);
    // cin.tie(0),cout.tie(0);
    CNM::init();
    int n;cin>>n;
    int ans=CNM::fac[n-1];
    
    int s=1,x=n-2;
    for(int i=2;i<=n;i++){
        int temp=C(x,s)*CNM::fac[n-1]%p;
        ans+=temp*inv(C(n-1,i-1),p)%mod;
        ans%=p;
        // printf("%d %d %d\n",i,temp,inv(C(n-1,i-1),p));
        x--;s++;
        if(s>x)break;
    }
    if(n==1)ans=1;
    cout<<ans<<endl;


    
    
}