#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;

// 用于快速幂的函数
ll qpow(ll a, ll b, ll mod) {
    ll ans = 1;
    while (b) {
        if (b & 1) ans = ans * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ans;
}

void solve() {
    int n;
    cin >> n;
    if (n == 1 || n == 2) {
        cout << 0 << endl;
        return;
    }
    
    // 计算阶乘和逆元
    vector<ll> fac(n + 1), ifac(n + 1);
    fac[0] = 1;
    for (int i = 1; i <= n; ++i) {
        fac[i] = fac[i - 1] * i % MOD;
    }
    ifac[n] = qpow(fac[n], MOD - 2, MOD);
    for (int i = n - 1; i >= 0; --i) {
        ifac[i] = ifac[i + 1] * (i + 1) % MOD;
    }
    
    // 计算答案
    ll ans = 0;
    for (int i = 1; i <= n; ++i) {
        if (i % 2 == 1) {
            ans = (ans + fac[n] * ifac[i] % MOD * ifac[n - i] % MOD) % MOD;
        } else {
            ans = (ans - fac[n] * ifac[i] % MOD * ifac[n - i] % MOD + MOD) % MOD;
        }
    }
    
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}