#include<bits/stdc++.h>
using namespace std;
const int N = 1e7 + 5, mod = 998244353., P = 1e9 + 9;
const int inf = 0x3f3f3f3f;
#define endl '\n'
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
int T; ll n, m;
ll fac[N], inv[N];
ll qpow(ll a, int n) {
    ll res = 1;
    while(n) {
        if(n&1) res = res*a % mod;
        a = a*a % mod;
        n >>= 1;
    }
    return res;
}
ll C(ll n, ll m) {
    return fac[n]*inv[m] % mod * inv[n-m] % mod;
}
void solve() {
    cin >> n;
    fac[0] = inv[0] = 1;
    for(int i = 1; i <= n; i++) {
        fac[i] = fac[i-1]*i % mod;
        inv[i] = inv[i-1]*qpow(i, mod-2) % mod;
    }
    ll ans = 0;
    for(int i = 1; i+i <= n+1; i++) {
        ans = (ans + C(n-i, i-1)*fac[i-1] % mod* fac[n-i] % mod) % mod;
    }
    cout << ans << '\n';
}   
int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    T = 1;
    //cin >> T;
    while(T--) solve();  
    return 0;
}