#include <bits/stdc++.h>
using namespace std;

const int N = 1e7 + 10, mod = 998244353;

int n, fac[N], inv[N], ans;

int Pow (int a, int k) {
    int res = 1;
    for (; k; k >>= 1, a = 1ll * a * a % mod)
        if (k & 1) res = 1ll * res * a % mod;
    return res;
}

int C (int n, int m) {
    if (n < m) return 0;
    return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}

int main () {
    fac[0] = 1;
    for (int i = 1; i < N; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
    inv[N - 1] = Pow(fac[N - 1], mod - 2);
    for (int i = N - 2; i >= 0; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
    cin >> n;
    ans = fac[n - 1];
    for (int i = 2; i <= n; i++)
        ans = (ans + 1ll * C(n - i, i - 1) * fac[i - 1] % mod * fac[n - i] % mod) % mod;
    cout << ans;
    return 0;
}