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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [";
    while (L != R) cerr << " " << *L++;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

constexpr int mod = 998244353;

constexpr int add(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b;
}

constexpr int mul(int64_t a, int64_t b) {
    return static_cast<int>(a * b % mod);
}

const int maxn = 10000007;
int inv[maxn], fac[maxn], ifac[maxn];

int C(int n, int k) {
    if (k < 0 || n < k) return 0;
    return mul(fac[n], mul(ifac[k], ifac[n - k]));
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    inv[1] = 1;
    for (int i = 2; i < maxn; i++)
        inv[i] = mul(inv[mod % i], mod - mod / i);
    fac[0] = ifac[0] = 1;
    for (int i = 1; i < maxn; i++)
        fac[i] = mul(fac[i-1], i), ifac[i] = mul(ifac[i-1], inv[i]);
    int n;
    cin >> n;
    int ans = 0;
    for (int i = 1; i <= (n + 1) / 2; i++) {
        ans = add(ans, mul(C(n - i, i - 1), mul(fac[i - 1], fac[n - i])));
    }
    cout << ans << '\n';
    return 0;
}