#include <bits/stdc++.h>

using i64 = long long;
const int N = 1e7;
const int mod = 998244353;

i64 fac[10000010], ifac[10000010];

i64 fp(i64 a, i64 b) {
    i64 t = 1;
    for (; b; b >>= 1, a = a * a % mod) {
        if (b & 1) {
            t = t * a % mod;
        }
    }
    return t;
}

void init() {
    fac[0] = 1;
    for (int i = 1; i <= N; ++i) {
        fac[i] = 1ll * i * fac[i - 1] % mod;
    }
    ifac[N] = fp(fac[N], mod - 2);
    for (int i = N - 1; i >= 0; i--) {
        ifac[i] = 1ll * (i + 1) * ifac[i + 1] % mod;
    }
}

i64 binom(int n, int m) {
    if (n < m || n < 0 || m < 0) {
        return 0;
    }
    return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    init();
    int n; std::cin >> n;
    i64 ans = 0;
    for (int i = 1; i <= n; ++i) {
        i64 t = fac[n - i] * fac[i - 1] % mod * binom(n - i, i - 1) % mod;
        ans = (ans + t) % mod;
    }

    std::cout << ans << "\n";
    return 0;
}