#include <bits/stdc++.h>

#define LL long long
#define ull unsigned long long
#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)

using namespace std;

template <typename T> inline void read(T &n) {
    T w = 1;
    n = 0;
    char ch = getchar();
    while (!isdigit(ch) && ch != EOF) {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (isdigit(ch) && ch != EOF) {
        n = (n << 3) + (n << 1) + (ch & 15);
        ch = getchar();
    }
    n *= w;
}

template <typename T> inline void write(T x) {
    T l = 0;
    ull y = 0;
    if (!x) { putchar(48); return; }
    if (x < 0) { x = -x; putchar('-'); }
    while (x) { y = y * 10 + x % 10; x /= 10; ++l; }
    while (l) { putchar(y % 10 + 48); y /= 10; --l; }
}

template <typename T> inline void writes(T x) {
    write(x);
    putchar(' ');
}

template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}

template <typename T> inline void checkmax(T &a, T b) { a = a > b ? a : b; }

template <typename T> inline void checkmin(T &a, T b) { a = a < b ? a : b; }

const int MOD = 998244353;

inline int ksm(int x, int y) {
    int k = 1;
    while (y) {
        if (y & 1) k = (LL)k * x % MOD;
        x = (LL)x * x % MOD;
        y >>= 1;
    }
    return k;
}

int fac[10000100];

int main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int n;
    cin >> n;
    fac[0] = 1;
    F(i, 1, n) fac[i] = (LL)fac[i - 1] * i % MOD;
    int ans = 0;
    F(i, 1, n) {
        if (n - i - i + 1 < 0) break;
        ans += (LL)fac[n - i] * ksm(fac[n - i - i + 1], MOD - 2) % MOD * fac[n - i] % MOD, ans %= MOD;
    }
    writeln(ans);
    return 0;
}