#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 998244353;
vector<int> fact, infact;
int power(int a, int b) {
    int res = 1;
    for (; b; b /= 2, a = 1LL * a * a % mod) {
        if (b % 2) {
            res = 1LL * res * a % mod;
        }
    }
    return res;
}
void Init(int n) {
    fact.resize(n + 1);
    infact.resize(n + 1);
    fact[0] = 1;
    infact[0] = 1;
    for (int i = 1; i <= n; i++) {
        fact[i] = 1ll * fact[i - 1] * i % mod;
        infact[i] = 1ll * infact[i - 1] * power(i, mod - 2) % mod;
    }
}
int C(int a, int b) {
    return 1ll * fact[a] * infact[b] % mod * infact[a - b] % mod;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);    
    
    int n; cin >> n;
    Init(n);
    ll ans = 0;
    for (int i = 1; n - i >= i - 1; i++) {
        ans = (ans + 1ll * fact[n - i] * fact[n - i] % mod * infact[n - 2 * i + 1] % mod) % mod;
    }
    cout << ans << '\n';

    return 0;
}