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

typedef long long ll;

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

ll fac[N], infac[N];

ll qpow(ll a, ll b) {
    ll res = 1;
    while(b) {
        if(b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

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

ll sub(ll a, ll b) {
    return (a - b + mod) % mod;
}

ll C(int n, int m) {
    return fac[n] * infac[m] % mod * infac[n - m] % mod;
}

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

    init();
    int n;
    cin >> n;
    ll ans = 0;
    for(int i = 1; i <= n; i ++ ) {
        ll res = fac[n - 1];
        if(n - i >= i - 1) {
            res = sub(res, C(n - i, i - 1) * fac[i - 1] % mod * fac[n - i] % mod);
        }
        ans = (ans + res) % mod;
    }
    cout << sub(fac[n], ans) << '\n';
    return 0;
}