#include<iostream>
#include<vector>
#include<set>
#include<algorithm>
#include<bitset>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
int mod = 998244353;

int add(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b;
}
int sub(int a, int b) {
    return a >= b ? a - b : a + mod - b;
}
int mul(int a, int b) {
    return 1ll * a * b % mod;
}
int binpow(int a, int n) {
    int res = 1;
    for (; n; a = mul(a, a), n >>= 1) {
        if (n & 1) res = mul(res, a);
    }
    return res;
}
int inv(int x) {
    return binpow(x, mod - 2);
}

const int N = 1e7 + 1;
int fact[N], ifact[N];

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

    fact[0] = 1;
    for (int i = 1; i < N; ++i) {
        fact[i] = mul(fact[i - 1], i);
    }
    ifact[N - 1] = inv(fact[N - 1]);
    for (int i = N - 2; i >= 0; --i) {
        ifact[i] = mul(ifact[i + 1], i + 1);
    }

    auto C = [&](int n, int k) -> int {
        if (n < 0 || k < 0 || n - k < 0) return 0;
        return mul(fact[n], mul(ifact[k], ifact[n - k]));
    };

    int n;
    cin >> n;
    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        ans = add(ans, mul(fact[i - 1], mul(fact[n - i], C(n - i, i - 1))));
    }
    cout << ans;
}