#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 998244353;
const int N = 1e7 + 1;
ll qpow(ll a,ll k){
    ll res = 1;
    while (k){
        if(k&1) res = res * a % MOD;
        a = a * a % MOD;
        k >>= 1;
    }
    return res;
}
ll fac[N] , infac[N];
void init(int N){
    fac[1] = 1 ;
    for(int i=2;i<N;i++){
        fac[i] = ( 1ll*fac[i-1] * i + MOD ) % MOD ;
    }
    fac[0] = 1 , infac[0] = 1 ;
    infac[N-1] = qpow(fac[N-1],MOD-2);
    for(int i=N-2;i>=1;i--){
        infac[i] = 1ll*(i+1)*infac[i+1]%MOD ;
    }
}
int C(int a,int b){
    if(b==0) return 1;
    if(a < b) return 0;
    return 1ll*fac[a]*infac[b]%MOD*infac[a-b]%MOD;
}
void solve(){
    int n;
    cin >> n;
    init(n+1);
    ll ans = 0;
    for(int i=1;i<=n;i++){
        if(2*i > n + 1) break;
        ans += C(n-i,i-1) * fac[n-i] % MOD * fac[i-1] % MOD;
        ans %= MOD;
    }
    cout << ans << '\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
//    cout << 997920 * 4 << '\n';
//    cin >> tt;
    while (tt--) solve();
}