#include <bits/stdc++.h>
//#define double long double
#define int long long
#define eps 1e-8
#define endl "\n"
using ll=long long;
const int N=1e7+5;
const int inf=1e11;
const int mod=998244353;
using namespace std;
typedef pair<int,int>P;
int fac[N],inv[N];
int qpow(int a,int b,int c){
    int ans=1;
    while(b){
        if(b&1) ans=ans*a%c;
        b>>=1,a=a*a%c;
    }
    return ans;
}
void init(){
    fac[0]=1;
    for(int i=1;i<=1e7;i++)
        fac[i]=fac[i-1]*i%mod;
    inv[10000000]=qpow(fac[10000000],mod-2,mod);
    for(int i=1e7-1;i>=0;i--)
        inv[i]=inv[i+1]*(i+1)%mod;
}
int C(int x,int y){
    if(x<y) return 0;
    int res=fac[x]*inv[y]%mod*inv[x-y]%mod;
    return res;

}
int A(int x,int y){
    int res=fac[y]*C(x,y)%mod;
    return res;
}
void solve(){
    int n;cin>>n;
    int ans=0;
    for(int i=1;i<=n;i++)
        ans=(ans+A(n-i,i-1)*fac[n-i]%mod)%mod;
    cout<<ans<<endl;
    return;
}



signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;init();//cin>>t;
    while(t--) solve();
    return 0;
}