#include <bits/stdc++.h>

int qpow(int a, int b, int p) {
    int ans = 1;
    for (; b; b >>= 1) {
        if (b & 1) ans = 1ll * ans * a % p;
        a = 1ll * a * a % p;
    }
    return ans;
}

const int N = 10001000;
const int mod = 998244353;

int n;

int fact[N], facv[N];
void fact_init(int n) {
    fact[0] = 1;
    for (int i = 1; i <= n; i ++) fact[i] = 1ll * fact[i - 1] * i % mod;

    facv[n] = qpow(fact[n], mod - 2, mod);
    for (int i = n - 1; i >= 0; i --) facv[i] = 1ll * facv[i + 1] * (i + 1) % mod;
}

int binom(int n, int m) {
    if (n < m) return 0;
    return 1ll * facv[m] * facv[n - m] % mod * fact[n] % mod;
}

int main() {
    scanf("%d", &n);

    fact_init(n);

    int ans = fact[n - 1];
    for (int x = 2; x <= n; x ++)
        ans = (ans + 1ll * fact[x - 1] * fact[n - x] % mod * binom(n - x, x - 1)) % mod;

    printf("%d\n", ans);

    return 0;
}